./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-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 99f48cdcb9a25adc64e4307e90599f4e37a0b97f677ff29ab3d60f24a1c8e980 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:21:13,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:21:13,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 10:21:13,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:21:13,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:21:13,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:21:13,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:21:13,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:21:13,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:21:13,465 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:21:13,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:21:13,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:21:13,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:21:13,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:21:13,466 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:21:13,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:21:13,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:21:13,467 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:21:13,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:21:13,467 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:21:13,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:21:13,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:21:13,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:21:13,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:21:13,467 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:21:13,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:21:13,468 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:21:13,468 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:21:13,468 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:21:13,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:21:13,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:21:13,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:21:13,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:21:13,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:21:13,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:21:13,469 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:21:13,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:21:13,469 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:21:13,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:21:13,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:21:13,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:21:13,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:21:13,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:21:13,470 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 -> 99f48cdcb9a25adc64e4307e90599f4e37a0b97f677ff29ab3d60f24a1c8e980 [2025-03-17 10:21:13,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:21:13,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:21:13,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:21:13,738 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:21:13,738 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:21:13,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i [2025-03-17 10:21:14,949 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746d5e31c/17baa985df14461095bb7b5e0d9a16e7/FLAGf5e16ab9d [2025-03-17 10:21:15,227 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:21:15,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i [2025-03-17 10:21:15,248 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746d5e31c/17baa985df14461095bb7b5e0d9a16e7/FLAGf5e16ab9d [2025-03-17 10:21:15,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746d5e31c/17baa985df14461095bb7b5e0d9a16e7 [2025-03-17 10:21:15,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:21:15,265 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:21:15,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:21:15,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:21:15,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:21:15,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:21:15" (1/1) ... [2025-03-17 10:21:15,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b0a4d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:15, skipping insertion in model container [2025-03-17 10:21:15,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:21:15" (1/1) ... [2025-03-17 10:21:15,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:21:15,554 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[33021,33034] [2025-03-17 10:21:15,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[44124,44137] [2025-03-17 10:21:15,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[44245,44258] [2025-03-17 10:21:15,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:21:15,648 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:21:15,677 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[33021,33034] [2025-03-17 10:21:15,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[44124,44137] [2025-03-17 10:21:15,739 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[44245,44258] [2025-03-17 10:21:15,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:21:15,773 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:21:15,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:15 WrapperNode [2025-03-17 10:21:15,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:21:15,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:21:15,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:21:15,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:21:15,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:15" (1/1) ... [2025-03-17 10:21:15,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:15" (1/1) ... [2025-03-17 10:21:15,849 INFO L138 Inliner]: procedures = 176, calls = 320, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1537 [2025-03-17 10:21:15,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:21:15,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:21:15,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:21:15,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:21:15,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:15" (1/1) ... [2025-03-17 10:21:15,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:15" (1/1) ... [2025-03-17 10:21:15,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:15" (1/1) ... [2025-03-17 10:21:15,957 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [2, 265, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2025-03-17 10:21:15,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:15" (1/1) ... [2025-03-17 10:21:15,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:15" (1/1) ... [2025-03-17 10:21:15,999 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:15" (1/1) ... [2025-03-17 10:21:16,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:15" (1/1) ... [2025-03-17 10:21:16,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:15" (1/1) ... [2025-03-17 10:21:16,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:15" (1/1) ... [2025-03-17 10:21:16,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:21:16,024 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:21:16,024 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:21:16,024 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:21:16,025 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:15" (1/1) ... [2025-03-17 10:21:16,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:21:16,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:21:16,051 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 10:21:16,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 10:21:16,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:21:16,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:21:16,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 10:21:16,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:21:16,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:21:16,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 10:21:16,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 10:21:16,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 10:21:16,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 10:21:16,074 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 10:21:16,074 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 10:21:16,074 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 10:21:16,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:21:16,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:21:16,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:21:16,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:21:16,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 10:21:16,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:21:16,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:21:16,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:21:16,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 10:21:16,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:21:16,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:21:16,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:21:16,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 10:21:16,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:21:16,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:21:16,290 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:21:16,292 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:21:17,451 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-17 10:21:17,521 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2025-03-17 10:21:17,521 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:21:17,568 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:21:17,568 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 10:21:17,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:21:17 BoogieIcfgContainer [2025-03-17 10:21:17,569 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:21:17,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:21:17,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:21:17,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:21:17,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:21:15" (1/3) ... [2025-03-17 10:21:17,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f2610d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:21:17, skipping insertion in model container [2025-03-17 10:21:17,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:15" (2/3) ... [2025-03-17 10:21:17,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f2610d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:21:17, skipping insertion in model container [2025-03-17 10:21:17,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:21:17" (3/3) ... [2025-03-17 10:21:17,576 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test7-2.i [2025-03-17 10:21:17,588 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:21:17,589 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test7-2.i that has 4 procedures, 429 locations, 1 initial locations, 41 loop locations, and 2 error locations. [2025-03-17 10:21:17,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:21:17,653 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;@179b9483, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:21:17,655 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 10:21:17,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 421 states, 414 states have (on average 1.6256038647342994) internal successors, (673), 416 states have internal predecessors, (673), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:21:17,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 10:21:17,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:17,665 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:17,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:17,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:17,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1768985098, now seen corresponding path program 1 times [2025-03-17 10:21:17,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:17,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814728763] [2025-03-17 10:21:17,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:17,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:17,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 10:21:17,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 10:21:17,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:17,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:17,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:17,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:17,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814728763] [2025-03-17 10:21:17,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814728763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:17,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:17,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:21:17,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349355762] [2025-03-17 10:21:17,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:17,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 10:21:17,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:17,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 10:21:17,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:21:17,812 INFO L87 Difference]: Start difference. First operand has 421 states, 414 states have (on average 1.6256038647342994) internal successors, (673), 416 states have internal predecessors, (673), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-17 10:21:17,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:17,931 INFO L93 Difference]: Finished difference Result 841 states and 1357 transitions. [2025-03-17 10:21:17,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 10:21:17,934 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-03-17 10:21:17,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:17,942 INFO L225 Difference]: With dead ends: 841 [2025-03-17 10:21:17,944 INFO L226 Difference]: Without dead ends: 385 [2025-03-17 10:21:17,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:21:17,948 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:17,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 564 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:21:17,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-17 10:21:17,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2025-03-17 10:21:18,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 379 states have (on average 1.4564643799472297) internal successors, (552), 380 states have internal predecessors, (552), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:21:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 558 transitions. [2025-03-17 10:21:18,009 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 558 transitions. Word has length 7 [2025-03-17 10:21:18,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:18,009 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 558 transitions. [2025-03-17 10:21:18,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-17 10:21:18,010 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 558 transitions. [2025-03-17 10:21:18,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 10:21:18,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:18,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:18,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:21:18,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:18,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:18,011 INFO L85 PathProgramCache]: Analyzing trace with hash 371005527, now seen corresponding path program 1 times [2025-03-17 10:21:18,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:18,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226828721] [2025-03-17 10:21:18,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:18,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:18,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 10:21:18,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 10:21:18,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:18,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:18,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:18,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226828721] [2025-03-17 10:21:18,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226828721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:18,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:18,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:21:18,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613741941] [2025-03-17 10:21:18,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:18,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:21:18,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:18,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:21:18,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:21:18,152 INFO L87 Difference]: Start difference. First operand 385 states and 558 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-17 10:21:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:18,361 INFO L93 Difference]: Finished difference Result 952 states and 1383 transitions. [2025-03-17 10:21:18,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:21:18,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-17 10:21:18,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:18,379 INFO L225 Difference]: With dead ends: 952 [2025-03-17 10:21:18,379 INFO L226 Difference]: Without dead ends: 764 [2025-03-17 10:21:18,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:21:18,381 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 543 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:18,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1485 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:21:18,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-03-17 10:21:18,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 387. [2025-03-17 10:21:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 381 states have (on average 1.4540682414698163) internal successors, (554), 382 states have internal predecessors, (554), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:21:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 560 transitions. [2025-03-17 10:21:18,400 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 560 transitions. Word has length 9 [2025-03-17 10:21:18,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:18,400 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 560 transitions. [2025-03-17 10:21:18,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-17 10:21:18,401 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 560 transitions. [2025-03-17 10:21:18,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 10:21:18,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:18,403 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] [2025-03-17 10:21:18,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:21:18,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:18,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:18,404 INFO L85 PathProgramCache]: Analyzing trace with hash 270728060, now seen corresponding path program 1 times [2025-03-17 10:21:18,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:18,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198874192] [2025-03-17 10:21:18,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:18,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:18,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 10:21:18,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 10:21:18,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:18,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:18,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:18,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198874192] [2025-03-17 10:21:18,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198874192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:18,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:18,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:21:18,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790118685] [2025-03-17 10:21:18,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:18,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:21:18,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:18,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:21:18,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:21:18,776 INFO L87 Difference]: Start difference. First operand 387 states and 560 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-17 10:21:18,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:18,910 INFO L93 Difference]: Finished difference Result 729 states and 1051 transitions. [2025-03-17 10:21:18,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:21:18,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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 83 [2025-03-17 10:21:18,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:18,913 INFO L225 Difference]: With dead ends: 729 [2025-03-17 10:21:18,913 INFO L226 Difference]: Without dead ends: 345 [2025-03-17 10:21:18,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:21:18,914 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 30 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:18,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1253 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:21:18,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-17 10:21:18,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-03-17 10:21:18,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 339 states have (on average 1.407079646017699) internal successors, (477), 340 states have internal predecessors, (477), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:21:18,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 483 transitions. [2025-03-17 10:21:18,932 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 483 transitions. Word has length 83 [2025-03-17 10:21:18,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:18,932 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 483 transitions. [2025-03-17 10:21:18,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-17 10:21:18,933 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 483 transitions. [2025-03-17 10:21:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 10:21:18,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:18,935 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] [2025-03-17 10:21:18,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:21:18,935 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:18,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:18,936 INFO L85 PathProgramCache]: Analyzing trace with hash -60110845, now seen corresponding path program 1 times [2025-03-17 10:21:18,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:18,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827143488] [2025-03-17 10:21:18,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:18,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:18,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 10:21:18,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 10:21:18,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:18,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:19,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:19,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827143488] [2025-03-17 10:21:19,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827143488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:19,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:19,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:21:19,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622978107] [2025-03-17 10:21:19,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:19,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:21:19,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:19,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:21:19,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:21:19,110 INFO L87 Difference]: Start difference. First operand 345 states and 483 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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-17 10:21:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:19,259 INFO L93 Difference]: Finished difference Result 937 states and 1322 transitions. [2025-03-17 10:21:19,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:21:19,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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 83 [2025-03-17 10:21:19,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:19,262 INFO L225 Difference]: With dead ends: 937 [2025-03-17 10:21:19,262 INFO L226 Difference]: Without dead ends: 595 [2025-03-17 10:21:19,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:21:19,263 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 296 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:19,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1028 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:21:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-17 10:21:19,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 588. [2025-03-17 10:21:19,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 582 states have (on average 1.4243986254295533) internal successors, (829), 583 states have internal predecessors, (829), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:21:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 835 transitions. [2025-03-17 10:21:19,284 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 835 transitions. Word has length 83 [2025-03-17 10:21:19,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:19,285 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 835 transitions. [2025-03-17 10:21:19,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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-17 10:21:19,285 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 835 transitions. [2025-03-17 10:21:19,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 10:21:19,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:19,287 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] [2025-03-17 10:21:19,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:21:19,288 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:19,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:19,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1501973141, now seen corresponding path program 1 times [2025-03-17 10:21:19,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:19,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174627096] [2025-03-17 10:21:19,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:19,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:19,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 10:21:19,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 10:21:19,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:19,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:19,667 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-17 10:21:19,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:19,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174627096] [2025-03-17 10:21:19,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174627096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:19,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:19,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:21:19,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489133021] [2025-03-17 10:21:19,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:19,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:21:19,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:19,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:21:19,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:21:19,669 INFO L87 Difference]: Start difference. First operand 588 states and 835 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-17 10:21:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:19,831 INFO L93 Difference]: Finished difference Result 867 states and 1230 transitions. [2025-03-17 10:21:19,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:21:19,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 98 [2025-03-17 10:21:19,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:19,838 INFO L225 Difference]: With dead ends: 867 [2025-03-17 10:21:19,838 INFO L226 Difference]: Without dead ends: 863 [2025-03-17 10:21:19,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:21:19,840 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 453 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:19,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1341 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:21:19,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-03-17 10:21:19,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 590. [2025-03-17 10:21:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 584 states have (on average 1.422945205479452) internal successors, (831), 585 states have internal predecessors, (831), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:21:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 837 transitions. [2025-03-17 10:21:19,857 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 837 transitions. Word has length 98 [2025-03-17 10:21:19,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:19,857 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 837 transitions. [2025-03-17 10:21:19,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-17 10:21:19,858 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 837 transitions. [2025-03-17 10:21:19,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:21:19,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:19,860 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] [2025-03-17 10:21:19,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:21:19,861 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:19,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:19,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1876427285, now seen corresponding path program 1 times [2025-03-17 10:21:19,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:19,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970973232] [2025-03-17 10:21:19,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:19,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:19,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:21:19,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:21:19,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:19,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:20,107 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-17 10:21:20,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:20,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970973232] [2025-03-17 10:21:20,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970973232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:20,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:20,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:21:20,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33791553] [2025-03-17 10:21:20,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:20,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:21:20,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:20,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:21:20,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:21:20,112 INFO L87 Difference]: Start difference. First operand 590 states and 837 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-17 10:21:20,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:20,222 INFO L93 Difference]: Finished difference Result 851 states and 1213 transitions. [2025-03-17 10:21:20,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:21:20,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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 150 [2025-03-17 10:21:20,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:20,224 INFO L225 Difference]: With dead ends: 851 [2025-03-17 10:21:20,225 INFO L226 Difference]: Without dead ends: 506 [2025-03-17 10:21:20,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:21:20,226 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 30 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:20,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1031 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:21:20,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-17 10:21:20,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-03-17 10:21:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 500 states have (on average 1.354) internal successors, (677), 501 states have internal predecessors, (677), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:21:20,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 683 transitions. [2025-03-17 10:21:20,244 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 683 transitions. Word has length 150 [2025-03-17 10:21:20,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:20,244 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 683 transitions. [2025-03-17 10:21:20,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-17 10:21:20,244 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 683 transitions. [2025-03-17 10:21:20,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:21:20,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:20,245 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] [2025-03-17 10:21:20,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:21:20,246 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:20,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:20,246 INFO L85 PathProgramCache]: Analyzing trace with hash 182742949, now seen corresponding path program 1 times [2025-03-17 10:21:20,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:20,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030412668] [2025-03-17 10:21:20,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:20,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:20,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:21:20,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:21:20,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:20,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:20,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:21:20,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:20,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030412668] [2025-03-17 10:21:20,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030412668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:20,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:20,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:21:20,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986073369] [2025-03-17 10:21:20,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:20,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:21:20,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:20,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:21:20,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:21:20,432 INFO L87 Difference]: Start difference. First operand 506 states and 683 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-17 10:21:20,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:20,674 INFO L93 Difference]: Finished difference Result 1068 states and 1441 transitions. [2025-03-17 10:21:20,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:21:20,674 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 150 [2025-03-17 10:21:20,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:20,677 INFO L225 Difference]: With dead ends: 1068 [2025-03-17 10:21:20,677 INFO L226 Difference]: Without dead ends: 650 [2025-03-17 10:21:20,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:21:20,679 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 795 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:20,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 708 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:21:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-03-17 10:21:20,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 643. [2025-03-17 10:21:20,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 637 states have (on average 1.3563579277864992) internal successors, (864), 638 states have internal predecessors, (864), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:21:20,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 870 transitions. [2025-03-17 10:21:20,697 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 870 transitions. Word has length 150 [2025-03-17 10:21:20,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:20,698 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 870 transitions. [2025-03-17 10:21:20,698 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-17 10:21:20,698 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 870 transitions. [2025-03-17 10:21:20,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 10:21:20,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:20,699 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] [2025-03-17 10:21:20,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:21:20,699 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:20,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:20,700 INFO L85 PathProgramCache]: Analyzing trace with hash -2050597257, now seen corresponding path program 1 times [2025-03-17 10:21:20,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:20,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468698018] [2025-03-17 10:21:20,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:20,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:20,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 10:21:20,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 10:21:20,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:20,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:21,369 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-17 10:21:21,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:21,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468698018] [2025-03-17 10:21:21,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468698018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:21:21,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122783320] [2025-03-17 10:21:21,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:21,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:21:21,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:21:21,372 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:21:21,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 10:21:21,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 10:21:21,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 10:21:21,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:21,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:21,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 10:21:21,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:21:21,691 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-17 10:21:21,853 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 19 treesize of output 11 [2025-03-17 10:21:21,870 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-17 10:21:21,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:21:22,013 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-17 10:21:22,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122783320] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:21:22,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:21:22,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2025-03-17 10:21:22,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757703173] [2025-03-17 10:21:22,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:21:22,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 10:21:22,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:22,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 10:21:22,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:21:22,016 INFO L87 Difference]: Start difference. First operand 643 states and 870 transitions. Second operand has 12 states, 12 states have (on average 26.5) internal successors, (318), 12 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-17 10:21:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:22,455 INFO L93 Difference]: Finished difference Result 2881 states and 3907 transitions. [2025-03-17 10:21:22,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 10:21:22,455 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 26.5) internal successors, (318), 12 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 160 [2025-03-17 10:21:22,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:22,463 INFO L225 Difference]: With dead ends: 2881 [2025-03-17 10:21:22,463 INFO L226 Difference]: Without dead ends: 2480 [2025-03-17 10:21:22,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 312 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-17 10:21:22,465 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 3177 mSDsluCounter, 3382 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3181 SdHoareTripleChecker+Valid, 4066 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:22,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3181 Valid, 4066 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:21:22,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2025-03-17 10:21:22,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 983. [2025-03-17 10:21:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 973 states have (on average 1.3504624871531345) internal successors, (1314), 974 states have internal predecessors, (1314), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 10:21:22,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1326 transitions. [2025-03-17 10:21:22,501 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1326 transitions. Word has length 160 [2025-03-17 10:21:22,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:22,502 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1326 transitions. [2025-03-17 10:21:22,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.5) internal successors, (318), 12 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-17 10:21:22,502 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1326 transitions. [2025-03-17 10:21:22,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-03-17 10:21:22,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:22,505 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] [2025-03-17 10:21:22,514 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-17 10:21:22,706 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-17 10:21:22,706 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:22,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:22,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1813442171, now seen corresponding path program 1 times [2025-03-17 10:21:22,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:22,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873012031] [2025-03-17 10:21:22,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:22,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:22,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-17 10:21:22,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-17 10:21:22,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:22,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:25,053 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-17 10:21:25,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:25,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873012031] [2025-03-17 10:21:25,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873012031] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:21:25,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804089081] [2025-03-17 10:21:25,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:25,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:21:25,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:21:25,056 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:21:25,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 10:21:25,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-17 10:21:25,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-17 10:21:25,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:25,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:25,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 1891 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 10:21:25,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:21:25,598 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-17 10:21:25,740 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 19 treesize of output 11 [2025-03-17 10:21:25,843 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 19 treesize of output 11 [2025-03-17 10:21:25,928 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 19 treesize of output 11 [2025-03-17 10:21:26,021 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 19 treesize of output 11 [2025-03-17 10:21:26,035 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-17 10:21:26,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:21:26,437 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-17 10:21:26,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804089081] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:21:26,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:21:26,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 23 [2025-03-17 10:21:26,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416182846] [2025-03-17 10:21:26,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:21:26,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 10:21:26,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:26,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 10:21:26,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2025-03-17 10:21:26,440 INFO L87 Difference]: Start difference. First operand 983 states and 1326 transitions. Second operand has 23 states, 23 states have (on average 42.78260869565217) internal successors, (984), 23 states have internal predecessors, (984), 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-17 10:21:27,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:27,904 INFO L93 Difference]: Finished difference Result 6115 states and 8302 transitions. [2025-03-17 10:21:27,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 10:21:27,905 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 42.78260869565217) internal successors, (984), 23 states have internal predecessors, (984), 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 382 [2025-03-17 10:21:27,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:27,923 INFO L225 Difference]: With dead ends: 6115 [2025-03-17 10:21:27,924 INFO L226 Difference]: Without dead ends: 5714 [2025-03-17 10:21:27,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 752 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=296, Invalid=696, Unknown=0, NotChecked=0, Total=992 [2025-03-17 10:21:27,928 INFO L435 NwaCegarLoop]: 1698 mSDtfsCounter, 6182 mSDsluCounter, 17021 mSDsCounter, 0 mSdLazyCounter, 2047 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6192 SdHoareTripleChecker+Valid, 18719 SdHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:27,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6192 Valid, 18719 Invalid, 2077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2047 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 10:21:27,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5714 states. [2025-03-17 10:21:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5714 to 1829. [2025-03-17 10:21:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1813 states have (on average 1.346938775510204) internal successors, (2442), 1814 states have internal predecessors, (2442), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:21:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2466 transitions. [2025-03-17 10:21:28,004 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2466 transitions. Word has length 382 [2025-03-17 10:21:28,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:28,005 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 2466 transitions. [2025-03-17 10:21:28,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 42.78260869565217) internal successors, (984), 23 states have internal predecessors, (984), 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-17 10:21:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2466 transitions. [2025-03-17 10:21:28,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 827 [2025-03-17 10:21:28,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:28,018 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] [2025-03-17 10:21:28,029 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-17 10:21:28,218 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-17 10:21:28,219 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:28,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:28,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1030581885, now seen corresponding path program 2 times [2025-03-17 10:21:28,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:28,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311369188] [2025-03-17 10:21:28,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:21:28,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:28,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 826 statements into 2 equivalence classes. [2025-03-17 10:21:28,447 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 71 of 826 statements. [2025-03-17 10:21:28,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:21:28,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:28,545 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-17 10:21:28,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:28,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311369188] [2025-03-17 10:21:28,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311369188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:28,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:28,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:21:28,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189300306] [2025-03-17 10:21:28,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:28,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:21:28,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:28,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:21:28,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:21:28,547 INFO L87 Difference]: Start difference. First operand 1829 states and 2466 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-17 10:21:28,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:28,853 INFO L93 Difference]: Finished difference Result 2328 states and 3151 transitions. [2025-03-17 10:21:28,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:21:28,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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 826 [2025-03-17 10:21:28,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:28,864 INFO L225 Difference]: With dead ends: 2328 [2025-03-17 10:21:28,864 INFO L226 Difference]: Without dead ends: 1930 [2025-03-17 10:21:28,865 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-17 10:21:28,866 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 80 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:28,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1627 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:21:28,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2025-03-17 10:21:28,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1835. [2025-03-17 10:21:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1819 states have (on average 1.3457943925233644) internal successors, (2448), 1820 states have internal predecessors, (2448), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:21:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2472 transitions. [2025-03-17 10:21:28,906 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2472 transitions. Word has length 826 [2025-03-17 10:21:28,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:28,907 INFO L471 AbstractCegarLoop]: Abstraction has 1835 states and 2472 transitions. [2025-03-17 10:21:28,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-17 10:21:28,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2472 transitions. [2025-03-17 10:21:28,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2025-03-17 10:21:28,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:28,921 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-17 10:21:28,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:21:28,921 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:28,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:28,922 INFO L85 PathProgramCache]: Analyzing trace with hash -450463642, now seen corresponding path program 1 times [2025-03-17 10:21:28,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:28,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800946172] [2025-03-17 10:21:28,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:28,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:29,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 827 statements into 1 equivalence classes. [2025-03-17 10:21:29,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 827 of 827 statements. [2025-03-17 10:21:29,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:29,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:30,863 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-17 10:21:30,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:30,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800946172] [2025-03-17 10:21:30,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800946172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:30,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:30,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:21:30,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505125347] [2025-03-17 10:21:30,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:30,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:21:30,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:30,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:21:30,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:21:30,866 INFO L87 Difference]: Start difference. First operand 1835 states and 2472 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-17 10:21:31,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:31,157 INFO L93 Difference]: Finished difference Result 2254 states and 3044 transitions. [2025-03-17 10:21:31,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:21:31,158 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-17 10:21:31,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:31,164 INFO L225 Difference]: With dead ends: 2254 [2025-03-17 10:21:31,164 INFO L226 Difference]: Without dead ends: 1850 [2025-03-17 10:21:31,166 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-17 10:21:31,167 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 14 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:31,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1512 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:21:31,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2025-03-17 10:21:31,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1847. [2025-03-17 10:21:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1831 states have (on average 1.345166575641726) internal successors, (2463), 1832 states have internal predecessors, (2463), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:21:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2487 transitions. [2025-03-17 10:21:31,210 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2487 transitions. Word has length 827 [2025-03-17 10:21:31,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:31,211 INFO L471 AbstractCegarLoop]: Abstraction has 1847 states and 2487 transitions. [2025-03-17 10:21:31,211 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-17 10:21:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2487 transitions. [2025-03-17 10:21:31,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2025-03-17 10:21:31,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:31,217 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-17 10:21:31,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:21:31,217 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:31,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:31,217 INFO L85 PathProgramCache]: Analyzing trace with hash -462459279, now seen corresponding path program 1 times [2025-03-17 10:21:31,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:31,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282566955] [2025-03-17 10:21:31,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:31,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:31,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes. [2025-03-17 10:21:31,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-03-17 10:21:31,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:31,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:37,733 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-17 10:21:37,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:37,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282566955] [2025-03-17 10:21:37,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282566955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:21:37,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004750224] [2025-03-17 10:21:37,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:37,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:21:37,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:21:37,736 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:21:37,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 10:21:38,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes. [2025-03-17 10:21:38,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-03-17 10:21:38,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:38,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:38,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 4149 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 10:21:38,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:21:38,744 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-17 10:21:38,866 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 19 treesize of output 11 [2025-03-17 10:21:38,954 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 19 treesize of output 11 [2025-03-17 10:21:39,037 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 19 treesize of output 11 [2025-03-17 10:21:39,121 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 19 treesize of output 11 [2025-03-17 10:21:39,191 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 19 treesize of output 11 [2025-03-17 10:21:39,272 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 19 treesize of output 11 [2025-03-17 10:21:39,350 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 19 treesize of output 11 [2025-03-17 10:21:39,431 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 19 treesize of output 11 [2025-03-17 10:21:39,515 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 19 treesize of output 11 [2025-03-17 10:21:39,583 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 19 treesize of output 11 [2025-03-17 10:21:39,601 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-17 10:21:39,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:21:40,416 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-17 10:21:40,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004750224] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:21:40,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:21:40,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 42 [2025-03-17 10:21:40,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410082270] [2025-03-17 10:21:40,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:21:40,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-17 10:21:40,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:40,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-17 10:21:40,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1127, Unknown=0, NotChecked=0, Total=1722 [2025-03-17 10:21:40,444 INFO L87 Difference]: Start difference. First operand 1847 states and 2487 transitions. Second operand has 42 states, 42 states have (on average 55.19047619047619) internal successors, (2318), 42 states have internal predecessors, (2318), 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-17 10:21:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:43,632 INFO L93 Difference]: Finished difference Result 13003 states and 17582 transitions. [2025-03-17 10:21:43,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-17 10:21:43,633 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 55.19047619047619) internal successors, (2318), 42 states have internal predecessors, (2318), 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 828 [2025-03-17 10:21:43,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:43,696 INFO L225 Difference]: With dead ends: 13003 [2025-03-17 10:21:43,699 INFO L226 Difference]: Without dead ends: 12584 [2025-03-17 10:21:43,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1697 GetRequests, 1633 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1128, Invalid=2778, Unknown=0, NotChecked=0, Total=3906 [2025-03-17 10:21:43,703 INFO L435 NwaCegarLoop]: 3726 mSDtfsCounter, 16802 mSDsluCounter, 50435 mSDsCounter, 0 mSdLazyCounter, 5882 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16824 SdHoareTripleChecker+Valid, 54161 SdHoareTripleChecker+Invalid, 5965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 5882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:43,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16824 Valid, 54161 Invalid, 5965 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [83 Valid, 5882 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 10:21:43,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12584 states. [2025-03-17 10:21:43,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12584 to 3539. [2025-03-17 10:21:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3539 states, 3511 states have (on average 1.3440615209342068) internal successors, (4719), 3512 states have internal predecessors, (4719), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 10:21:43,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3539 states to 3539 states and 4767 transitions. [2025-03-17 10:21:43,827 INFO L78 Accepts]: Start accepts. Automaton has 3539 states and 4767 transitions. Word has length 828 [2025-03-17 10:21:43,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:43,828 INFO L471 AbstractCegarLoop]: Abstraction has 3539 states and 4767 transitions. [2025-03-17 10:21:43,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 55.19047619047619) internal successors, (2318), 42 states have internal predecessors, (2318), 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-17 10:21:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3539 states and 4767 transitions. [2025-03-17 10:21:43,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1717 [2025-03-17 10:21:43,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:43,856 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] [2025-03-17 10:21:43,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 10:21:44,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:21:44,057 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:44,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:44,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1153137793, now seen corresponding path program 2 times [2025-03-17 10:21:44,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:44,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918758236] [2025-03-17 10:21:44,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:21:44,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:44,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1716 statements into 2 equivalence classes. [2025-03-17 10:21:44,428 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 73 of 1716 statements. [2025-03-17 10:21:44,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:21:44,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 17100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17100 trivial. 0 not checked. [2025-03-17 10:21:44,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:44,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918758236] [2025-03-17 10:21:44,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918758236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:44,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:44,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 10:21:44,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146940882] [2025-03-17 10:21:44,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:44,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 10:21:44,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:44,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 10:21:44,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:21:44,596 INFO L87 Difference]: Start difference. First operand 3539 states and 4767 transitions. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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-17 10:21:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:45,129 INFO L93 Difference]: Finished difference Result 4018 states and 5417 transitions. [2025-03-17 10:21:45,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:21:45,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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 1716 [2025-03-17 10:21:45,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:45,138 INFO L225 Difference]: With dead ends: 4018 [2025-03-17 10:21:45,138 INFO L226 Difference]: Without dead ends: 3602 [2025-03-17 10:21:45,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 10:21:45,140 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 41 mSDsluCounter, 2097 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2457 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:45,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2457 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:21:45,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3602 states. [2025-03-17 10:21:45,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3602 to 3566. [2025-03-17 10:21:45,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3566 states, 3538 states have (on average 1.3439796495195024) internal successors, (4755), 3539 states have internal predecessors, (4755), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 10:21:45,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3566 states to 3566 states and 4803 transitions. [2025-03-17 10:21:45,229 INFO L78 Accepts]: Start accepts. Automaton has 3566 states and 4803 transitions. Word has length 1716 [2025-03-17 10:21:45,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:45,231 INFO L471 AbstractCegarLoop]: Abstraction has 3566 states and 4803 transitions. [2025-03-17 10:21:45,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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-17 10:21:45,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3566 states and 4803 transitions. [2025-03-17 10:21:45,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1717 [2025-03-17 10:21:45,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:45,246 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] [2025-03-17 10:21:45,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 10:21:45,247 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:45,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:45,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1450185498, now seen corresponding path program 1 times [2025-03-17 10:21:45,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:45,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446088808] [2025-03-17 10:21:45,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:45,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:45,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1716 statements into 1 equivalence classes. [2025-03-17 10:21:46,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1716 of 1716 statements. [2025-03-17 10:21:46,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:46,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 17100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17100 trivial. 0 not checked. [2025-03-17 10:21:49,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:49,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446088808] [2025-03-17 10:21:49,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446088808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:49,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:49,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 10:21:49,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614557920] [2025-03-17 10:21:49,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:49,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 10:21:49,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:49,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 10:21:49,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:21:49,349 INFO L87 Difference]: Start difference. First operand 3566 states and 4803 transitions. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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-17 10:21:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:49,691 INFO L93 Difference]: Finished difference Result 4015 states and 5417 transitions. [2025-03-17 10:21:49,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:21:49,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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 1716 [2025-03-17 10:21:49,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:49,697 INFO L225 Difference]: With dead ends: 4015 [2025-03-17 10:21:49,697 INFO L226 Difference]: Without dead ends: 3572 [2025-03-17 10:21:49,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:21:49,698 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 31 mSDsluCounter, 2123 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2480 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:49,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2480 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:21:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3572 states. [2025-03-17 10:21:49,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3572 to 3563. [2025-03-17 10:21:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3535 states have (on average 1.3425742574257427) internal successors, (4746), 3536 states have internal predecessors, (4746), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 10:21:49,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 4794 transitions. [2025-03-17 10:21:49,758 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 4794 transitions. Word has length 1716 [2025-03-17 10:21:49,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:49,759 INFO L471 AbstractCegarLoop]: Abstraction has 3563 states and 4794 transitions. [2025-03-17 10:21:49,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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-17 10:21:49,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 4794 transitions. [2025-03-17 10:21:49,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1718 [2025-03-17 10:21:49,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:49,800 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] [2025-03-17 10:21:49,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 10:21:49,800 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:49,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:49,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1252489069, now seen corresponding path program 1 times [2025-03-17 10:21:49,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:49,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533808368] [2025-03-17 10:21:49,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:49,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:50,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1717 statements into 1 equivalence classes. [2025-03-17 10:21:50,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1717 of 1717 statements. [2025-03-17 10:21:50,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:50,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 17100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17100 trivial. 0 not checked. [2025-03-17 10:21:53,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:53,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533808368] [2025-03-17 10:21:53,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533808368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:53,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:53,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:21:53,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858095733] [2025-03-17 10:21:53,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:53,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:21:53,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:53,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:21:53,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:21:53,019 INFO L87 Difference]: Start difference. First operand 3563 states and 4794 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 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-17 10:21:53,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:53,197 INFO L93 Difference]: Finished difference Result 4012 states and 5399 transitions. [2025-03-17 10:21:53,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:21:53,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 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 1717 [2025-03-17 10:21:53,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:53,204 INFO L225 Difference]: With dead ends: 4012 [2025-03-17 10:21:53,205 INFO L226 Difference]: Without dead ends: 3572 [2025-03-17 10:21:53,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:21:53,206 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 8 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:53,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1259 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:21:53,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3572 states. [2025-03-17 10:21:53,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3572 to 3572. [2025-03-17 10:21:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3572 states, 3544 states have (on average 1.341704288939052) internal successors, (4755), 3545 states have internal predecessors, (4755), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 10:21:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 4803 transitions. [2025-03-17 10:21:53,269 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 4803 transitions. Word has length 1717 [2025-03-17 10:21:53,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:53,270 INFO L471 AbstractCegarLoop]: Abstraction has 3572 states and 4803 transitions. [2025-03-17 10:21:53,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 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-17 10:21:53,271 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 4803 transitions. [2025-03-17 10:21:53,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1718 [2025-03-17 10:21:53,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:53,286 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] [2025-03-17 10:21:53,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:21:53,287 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:53,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:53,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1284033279, now seen corresponding path program 1 times [2025-03-17 10:21:53,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:53,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982439613] [2025-03-17 10:21:53,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:53,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:53,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1717 statements into 1 equivalence classes. [2025-03-17 10:21:54,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1717 of 1717 statements. [2025-03-17 10:21:54,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:54,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:22:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 17100 backedges. 0 proven. 17096 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:22:24,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:22:24,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982439613] [2025-03-17 10:22:24,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982439613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:22:24,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900897776] [2025-03-17 10:22:24,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:22:24,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:22:24,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:22:24,265 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:22:24,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 10:22:25,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1717 statements into 1 equivalence classes. [2025-03-17 10:22:26,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1717 of 1717 statements. [2025-03-17 10:22:26,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:22:26,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:22:26,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 8659 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 10:22:26,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:22:26,311 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-17 10:22:26,425 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 19 treesize of output 11 [2025-03-17 10:22:26,492 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 19 treesize of output 11 [2025-03-17 10:22:26,565 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 19 treesize of output 11 [2025-03-17 10:22:26,630 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 19 treesize of output 11 [2025-03-17 10:22:26,695 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 19 treesize of output 11 [2025-03-17 10:22:26,763 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 19 treesize of output 11 [2025-03-17 10:22:26,828 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 19 treesize of output 11 [2025-03-17 10:22:26,894 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 19 treesize of output 11 [2025-03-17 10:22:26,960 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 19 treesize of output 11 [2025-03-17 10:22:27,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 10:22:27,095 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 19 treesize of output 11 [2025-03-17 10:22:27,161 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 19 treesize of output 11 [2025-03-17 10:22:27,228 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 19 treesize of output 11 [2025-03-17 10:22:27,301 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 19 treesize of output 11 [2025-03-17 10:22:27,378 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 19 treesize of output 11 [2025-03-17 10:22:27,451 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 19 treesize of output 11 [2025-03-17 10:22:27,521 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 19 treesize of output 11 [2025-03-17 10:22:27,592 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 19 treesize of output 11 [2025-03-17 10:22:27,669 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 19 treesize of output 11 [2025-03-17 10:22:27,745 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 19 treesize of output 11 [2025-03-17 10:22:27,818 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 19 treesize of output 11 [2025-03-17 10:22:27,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 10:22:27,921 INFO L134 CoverageAnalysis]: Checked inductivity of 17100 backedges. 0 proven. 17096 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:22:27,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:22:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 17100 backedges. 0 proven. 17096 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:22:30,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900897776] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:22:30,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:22:30,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 26, 26] total 79 [2025-03-17 10:22:30,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441257890] [2025-03-17 10:22:30,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:22:30,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2025-03-17 10:22:30,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:22:30,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2025-03-17 10:22:30,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2226, Invalid=3936, Unknown=0, NotChecked=0, Total=6162 [2025-03-17 10:22:30,051 INFO L87 Difference]: Start difference. First operand 3572 states and 4803 transitions. Second operand has 79 states, 79 states have (on average 63.075949367088604) internal successors, (4983), 79 states have internal predecessors, (4983), 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)