./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.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 8e24809269f51bce916d93021d3fd241dd9f82f81ed2d62c2bdb32d3cd025077 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:40:56,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:40:56,499 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:40:56,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:40:56,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:40:56,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:40:56,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:40:56,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:40:56,518 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:40:56,519 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:40:56,519 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:40:56,519 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:40:56,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:40:56,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:40:56,519 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:40:56,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:40:56,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:40:56,519 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:40:56,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:40:56,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:40:56,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:40:56,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:40:56,520 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:40:56,520 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:40:56,520 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:40:56,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:40:56,520 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:40:56,520 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:40:56,520 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:40:56,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:40:56,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:40:56,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:40:56,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:40:56,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:40:56,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:40:56,521 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:40:56,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:40:56,521 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:40:56,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:40:56,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:40:56,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:40:56,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:40:56,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:40:56,522 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 -> 8e24809269f51bce916d93021d3fd241dd9f82f81ed2d62c2bdb32d3cd025077 [2025-03-08 16:40:56,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:40:56,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:40:56,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:40:56,765 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:40:56,766 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:40:56,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i [2025-03-08 16:40:57,929 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a704495f/dfd907087c0b4e5c891b22e1d0129529/FLAGe52093ce1 [2025-03-08 16:40:58,162 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:40:58,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i [2025-03-08 16:40:58,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a704495f/dfd907087c0b4e5c891b22e1d0129529/FLAGe52093ce1 [2025-03-08 16:40:58,180 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a704495f/dfd907087c0b4e5c891b22e1d0129529 [2025-03-08 16:40:58,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:40:58,183 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:40:58,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:40:58,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:40:58,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:40:58,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:40:58" (1/1) ... [2025-03-08 16:40:58,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c621b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:58, skipping insertion in model container [2025-03-08 16:40:58,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:40:58" (1/1) ... [2025-03-08 16:40:58,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:40:58,293 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i[916,929] [2025-03-08 16:40:58,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:40:58,358 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:40:58,368 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i[916,929] [2025-03-08 16:40:58,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:40:58,421 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:40:58,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:58 WrapperNode [2025-03-08 16:40:58,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:40:58,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:40:58,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:40:58,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:40:58,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:58" (1/1) ... [2025-03-08 16:40:58,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:58" (1/1) ... [2025-03-08 16:40:58,473 INFO L138 Inliner]: procedures = 29, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 525 [2025-03-08 16:40:58,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:40:58,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:40:58,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:40:58,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:40:58,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:58" (1/1) ... [2025-03-08 16:40:58,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:58" (1/1) ... [2025-03-08 16:40:58,483 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:58" (1/1) ... [2025-03-08 16:40:58,506 INFO L175 MemorySlicer]: Split 133 memory accesses to 16 slices as follows [2, 3, 12, 12, 6, 5, 10, 7, 10, 10, 12, 17, 6, 10, 5, 6]. 13 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 1]. [2025-03-08 16:40:58,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:58" (1/1) ... [2025-03-08 16:40:58,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:58" (1/1) ... [2025-03-08 16:40:58,528 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:58" (1/1) ... [2025-03-08 16:40:58,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:58" (1/1) ... [2025-03-08 16:40:58,534 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:58" (1/1) ... [2025-03-08 16:40:58,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:58" (1/1) ... [2025-03-08 16:40:58,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:40:58,546 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:40:58,546 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:40:58,546 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:40:58,547 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:58" (1/1) ... [2025-03-08 16:40:58,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:40:58,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:40:58,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:40:58,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:40:58,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:40:58,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-08 16:40:58,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-08 16:40:58,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-08 16:40:58,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-08 16:40:58,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-08 16:40:58,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-08 16:40:58,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-08 16:40:58,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-08 16:40:58,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-08 16:40:58,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-08 16:40:58,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-03-08 16:40:58,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-03-08 16:40:58,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-03-08 16:40:58,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-03-08 16:40:58,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-03-08 16:40:58,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2025-03-08 16:40:58,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:40:58,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:40:58,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:40:58,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:40:58,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:40:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 16:40:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 16:40:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 16:40:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 16:40:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 16:40:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 16:40:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 16:40:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 16:40:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 16:40:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 16:40:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 16:40:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-08 16:40:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-08 16:40:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-08 16:40:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-08 16:40:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:40:58,596 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 16:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 16:40:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 16:40:58,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:40:58,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:40:58,762 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:40:58,763 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:40:59,132 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~short89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~ite94#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite116#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite113#1;havoc property_#t~mem102#1;havoc property_#t~ite112#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~ite111#1;havoc property_#t~mem108#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~short107#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~short117#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem121#1;havoc property_#t~ite124#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short127#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite136#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~mem135#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~short134#1;havoc property_#t~short137#1; [2025-03-08 16:40:59,184 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-03-08 16:40:59,185 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:40:59,194 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:40:59,196 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:40:59,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:40:59 BoogieIcfgContainer [2025-03-08 16:40:59,197 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:40:59,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:40:59,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:40:59,203 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:40:59,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:40:58" (1/3) ... [2025-03-08 16:40:59,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504695c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:40:59, skipping insertion in model container [2025-03-08 16:40:59,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:58" (2/3) ... [2025-03-08 16:40:59,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504695c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:40:59, skipping insertion in model container [2025-03-08 16:40:59,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:40:59" (3/3) ... [2025-03-08 16:40:59,205 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-53.i [2025-03-08 16:40:59,215 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:40:59,217 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-53.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:40:59,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:40:59,266 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;@2bb16c89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:40:59,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:40:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:40:59,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 16:40:59,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:40:59,279 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:40:59,279 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:40:59,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:40:59,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1784361753, now seen corresponding path program 1 times [2025-03-08 16:40:59,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:40:59,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509223714] [2025-03-08 16:40:59,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:40:59,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:40:59,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:40:59,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:40:59,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:40:59,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:40:59,560 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 16:40:59,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:40:59,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509223714] [2025-03-08 16:40:59,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509223714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:40:59,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102507551] [2025-03-08 16:40:59,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:40:59,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:40:59,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:40:59,563 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:40:59,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:40:59,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:40:59,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:40:59,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:40:59,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:40:59,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:40:59,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:40:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 16:40:59,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:40:59,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102507551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:40:59,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:40:59,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:40:59,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334424513] [2025-03-08 16:40:59,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:40:59,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:40:59,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:40:59,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:40:59,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:40:59,871 INFO L87 Difference]: Start difference. First operand has 111 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:40:59,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:40:59,888 INFO L93 Difference]: Finished difference Result 216 states and 337 transitions. [2025-03-08 16:40:59,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:40:59,890 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2025-03-08 16:40:59,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:40:59,895 INFO L225 Difference]: With dead ends: 216 [2025-03-08 16:40:59,896 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 16:40:59,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:40:59,901 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:40:59,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:40:59,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 16:40:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-08 16:40:59,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:40:59,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2025-03-08 16:40:59,933 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 140 [2025-03-08 16:40:59,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:40:59,933 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2025-03-08 16:40:59,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:40:59,934 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2025-03-08 16:40:59,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 16:40:59,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:40:59,936 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:40:59,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 16:41:00,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:41:00,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:00,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:00,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1855035319, now seen corresponding path program 1 times [2025-03-08 16:41:00,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:00,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082031148] [2025-03-08 16:41:00,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:00,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:00,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:41:00,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:41:00,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:00,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:00,594 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:41:00,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:00,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082031148] [2025-03-08 16:41:00,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082031148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:41:00,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:41:00,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:41:00,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346647535] [2025-03-08 16:41:00,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:41:00,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:41:00,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:00,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:41:00,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:41:00,595 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:41:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:00,639 INFO L93 Difference]: Finished difference Result 213 states and 307 transitions. [2025-03-08 16:41:00,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:41:00,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2025-03-08 16:41:00,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:00,644 INFO L225 Difference]: With dead ends: 213 [2025-03-08 16:41:00,644 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 16:41:00,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:41:00,645 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:00,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:41:00,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 16:41:00,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-08 16:41:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:41:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2025-03-08 16:41:00,657 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 140 [2025-03-08 16:41:00,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:00,658 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2025-03-08 16:41:00,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:41:00,659 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2025-03-08 16:41:00,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 16:41:00,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:00,660 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:00,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:41:00,660 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:00,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:00,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1929397800, now seen corresponding path program 1 times [2025-03-08 16:41:00,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:00,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675848336] [2025-03-08 16:41:00,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:00,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:00,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:41:00,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:41:00,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:00,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:41:01,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:01,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675848336] [2025-03-08 16:41:01,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675848336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:41:01,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:41:01,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:41:01,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467671187] [2025-03-08 16:41:01,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:41:01,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:41:01,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:01,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:41:01,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:41:01,696 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:41:01,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:01,922 INFO L93 Difference]: Finished difference Result 219 states and 311 transitions. [2025-03-08 16:41:01,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:41:01,923 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 140 [2025-03-08 16:41:01,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:01,925 INFO L225 Difference]: With dead ends: 219 [2025-03-08 16:41:01,925 INFO L226 Difference]: Without dead ends: 114 [2025-03-08 16:41:01,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:41:01,928 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 216 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:01,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 546 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:41:01,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-08 16:41:01,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-08 16:41:01,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 93 states have internal predecessors, (123), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:41:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2025-03-08 16:41:01,938 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 140 [2025-03-08 16:41:01,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:01,939 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2025-03-08 16:41:01,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:41:01,939 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2025-03-08 16:41:01,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 16:41:01,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:01,940 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:01,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:41:01,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:01,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:01,944 INFO L85 PathProgramCache]: Analyzing trace with hash 132446441, now seen corresponding path program 1 times [2025-03-08 16:41:01,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:01,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062449067] [2025-03-08 16:41:01,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:01,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:01,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:41:02,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:41:02,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:02,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:41:02,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:02,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062449067] [2025-03-08 16:41:02,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062449067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:41:02,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:41:02,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:41:02,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364923897] [2025-03-08 16:41:02,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:41:02,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:41:02,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:02,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:41:02,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:41:02,852 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:41:03,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:03,070 INFO L93 Difference]: Finished difference Result 336 states and 470 transitions. [2025-03-08 16:41:03,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:41:03,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2025-03-08 16:41:03,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:03,074 INFO L225 Difference]: With dead ends: 336 [2025-03-08 16:41:03,075 INFO L226 Difference]: Without dead ends: 225 [2025-03-08 16:41:03,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:41:03,076 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 154 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:03,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 588 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:41:03,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-08 16:41:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2025-03-08 16:41:03,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 178 states have (on average 1.3258426966292134) internal successors, (236), 178 states have internal predecessors, (236), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 16:41:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 308 transitions. [2025-03-08 16:41:03,108 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 308 transitions. Word has length 140 [2025-03-08 16:41:03,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:03,109 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 308 transitions. [2025-03-08 16:41:03,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:41:03,110 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 308 transitions. [2025-03-08 16:41:03,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 16:41:03,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:03,114 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:03,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:41:03,114 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:03,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:03,115 INFO L85 PathProgramCache]: Analyzing trace with hash 43742796, now seen corresponding path program 1 times [2025-03-08 16:41:03,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:03,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493293839] [2025-03-08 16:41:03,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:03,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:03,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:41:03,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:41:03,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:03,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:04,099 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:41:04,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:04,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493293839] [2025-03-08 16:41:04,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493293839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:41:04,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:41:04,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:41:04,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118358200] [2025-03-08 16:41:04,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:41:04,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:41:04,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:04,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:41:04,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:41:04,100 INFO L87 Difference]: Start difference. First operand 219 states and 308 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:41:04,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:04,402 INFO L93 Difference]: Finished difference Result 330 states and 463 transitions. [2025-03-08 16:41:04,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:41:04,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 142 [2025-03-08 16:41:04,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:04,404 INFO L225 Difference]: With dead ends: 330 [2025-03-08 16:41:04,405 INFO L226 Difference]: Without dead ends: 219 [2025-03-08 16:41:04,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:41:04,406 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 291 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:04,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 515 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:41:04,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-08 16:41:04,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 112. [2025-03-08 16:41:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:41:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 155 transitions. [2025-03-08 16:41:04,426 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 155 transitions. Word has length 142 [2025-03-08 16:41:04,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:04,426 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 155 transitions. [2025-03-08 16:41:04,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:41:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 155 transitions. [2025-03-08 16:41:04,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:41:04,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:04,428 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:04,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:41:04,429 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:04,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:04,430 INFO L85 PathProgramCache]: Analyzing trace with hash 458370098, now seen corresponding path program 1 times [2025-03-08 16:41:04,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:04,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137269388] [2025-03-08 16:41:04,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:04,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:04,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:41:04,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:41:04,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:04,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:41:04,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:04,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137269388] [2025-03-08 16:41:04,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137269388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:41:04,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:41:04,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:41:04,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588673369] [2025-03-08 16:41:04,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:41:04,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:41:04,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:04,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:41:04,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:41:04,618 INFO L87 Difference]: Start difference. First operand 112 states and 155 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:41:04,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:04,647 INFO L93 Difference]: Finished difference Result 221 states and 307 transitions. [2025-03-08 16:41:04,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:41:04,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-08 16:41:04,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:04,649 INFO L225 Difference]: With dead ends: 221 [2025-03-08 16:41:04,649 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 16:41:04,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:41:04,650 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:04,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:41:04,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 16:41:04,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-08 16:41:04,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:41:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 154 transitions. [2025-03-08 16:41:04,664 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 154 transitions. Word has length 145 [2025-03-08 16:41:04,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:04,665 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 154 transitions. [2025-03-08 16:41:04,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:41:04,665 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 154 transitions. [2025-03-08 16:41:04,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:41:04,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:04,666 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:04,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:41:04,666 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:04,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:04,666 INFO L85 PathProgramCache]: Analyzing trace with hash 164967091, now seen corresponding path program 1 times [2025-03-08 16:41:04,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:04,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745315431] [2025-03-08 16:41:04,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:04,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:04,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:41:04,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:41:04,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:04,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:05,340 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:41:05,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:05,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745315431] [2025-03-08 16:41:05,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745315431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:41:05,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:41:05,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:41:05,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584483987] [2025-03-08 16:41:05,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:41:05,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:41:05,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:05,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:41:05,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:41:05,342 INFO L87 Difference]: Start difference. First operand 112 states and 154 transitions. Second operand has 10 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:41:05,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:05,665 INFO L93 Difference]: Finished difference Result 299 states and 409 transitions. [2025-03-08 16:41:05,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:41:05,666 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 145 [2025-03-08 16:41:05,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:05,667 INFO L225 Difference]: With dead ends: 299 [2025-03-08 16:41:05,667 INFO L226 Difference]: Without dead ends: 190 [2025-03-08 16:41:05,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:41:05,668 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 221 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:05,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1148 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:41:05,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-08 16:41:05,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2025-03-08 16:41:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 154 states have (on average 1.2922077922077921) internal successors, (199), 155 states have internal predecessors, (199), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:41:05,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 255 transitions. [2025-03-08 16:41:05,687 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 255 transitions. Word has length 145 [2025-03-08 16:41:05,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:05,688 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 255 transitions. [2025-03-08 16:41:05,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:41:05,688 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 255 transitions. [2025-03-08 16:41:05,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 16:41:05,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:05,689 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:05,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:41:05,689 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:05,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:05,690 INFO L85 PathProgramCache]: Analyzing trace with hash -409823601, now seen corresponding path program 1 times [2025-03-08 16:41:05,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:05,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355585004] [2025-03-08 16:41:05,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:05,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:05,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 16:41:05,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 16:41:05,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:05,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:41:06,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:06,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355585004] [2025-03-08 16:41:06,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355585004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:41:06,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:41:06,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:41:06,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593568731] [2025-03-08 16:41:06,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:41:06,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:41:06,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:06,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:41:06,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:41:06,604 INFO L87 Difference]: Start difference. First operand 187 states and 255 transitions. Second operand has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:41:07,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:07,246 INFO L93 Difference]: Finished difference Result 607 states and 829 transitions. [2025-03-08 16:41:07,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:41:07,246 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 146 [2025-03-08 16:41:07,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:07,249 INFO L225 Difference]: With dead ends: 607 [2025-03-08 16:41:07,249 INFO L226 Difference]: Without dead ends: 423 [2025-03-08 16:41:07,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-03-08 16:41:07,251 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 234 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:07,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1567 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:41:07,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-08 16:41:07,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 416. [2025-03-08 16:41:07,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 348 states have (on average 1.3074712643678161) internal successors, (455), 351 states have internal predecessors, (455), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:41:07,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 571 transitions. [2025-03-08 16:41:07,305 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 571 transitions. Word has length 146 [2025-03-08 16:41:07,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:07,306 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 571 transitions. [2025-03-08 16:41:07,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:41:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 571 transitions. [2025-03-08 16:41:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 16:41:07,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:07,309 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:07,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:41:07,309 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:07,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:07,310 INFO L85 PathProgramCache]: Analyzing trace with hash 2088192336, now seen corresponding path program 1 times [2025-03-08 16:41:07,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:07,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562473680] [2025-03-08 16:41:07,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:07,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:07,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 16:41:07,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 16:41:07,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:07,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:41:08,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:08,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562473680] [2025-03-08 16:41:08,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562473680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:41:08,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:41:08,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 16:41:08,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520238670] [2025-03-08 16:41:08,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:41:08,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:41:08,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:08,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:41:08,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:41:08,077 INFO L87 Difference]: Start difference. First operand 416 states and 571 transitions. Second operand has 13 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:41:08,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:08,506 INFO L93 Difference]: Finished difference Result 947 states and 1296 transitions. [2025-03-08 16:41:08,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:41:08,507 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 146 [2025-03-08 16:41:08,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:08,510 INFO L225 Difference]: With dead ends: 947 [2025-03-08 16:41:08,510 INFO L226 Difference]: Without dead ends: 534 [2025-03-08 16:41:08,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:41:08,511 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 237 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:08,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 914 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:41:08,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-08 16:41:08,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 442. [2025-03-08 16:41:08,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 374 states have (on average 1.2941176470588236) internal successors, (484), 377 states have internal predecessors, (484), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:41:08,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 600 transitions. [2025-03-08 16:41:08,562 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 600 transitions. Word has length 146 [2025-03-08 16:41:08,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:08,562 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 600 transitions. [2025-03-08 16:41:08,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:41:08,562 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 600 transitions. [2025-03-08 16:41:08,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 16:41:08,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:08,564 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:08,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:41:08,564 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:08,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:08,565 INFO L85 PathProgramCache]: Analyzing trace with hash -818647826, now seen corresponding path program 1 times [2025-03-08 16:41:08,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:08,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206670297] [2025-03-08 16:41:08,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:08,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:08,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 16:41:08,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 16:41:08,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:08,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:09,655 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:41:09,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:09,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206670297] [2025-03-08 16:41:09,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206670297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:41:09,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:41:09,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 16:41:09,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046873066] [2025-03-08 16:41:09,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:41:09,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 16:41:09,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:09,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 16:41:09,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:41:09,657 INFO L87 Difference]: Start difference. First operand 442 states and 600 transitions. Second operand has 18 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-08 16:41:10,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:10,337 INFO L93 Difference]: Finished difference Result 918 states and 1243 transitions. [2025-03-08 16:41:10,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:41:10,337 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 146 [2025-03-08 16:41:10,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:10,342 INFO L225 Difference]: With dead ends: 918 [2025-03-08 16:41:10,342 INFO L226 Difference]: Without dead ends: 479 [2025-03-08 16:41:10,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2025-03-08 16:41:10,343 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 259 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:10,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1714 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:41:10,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-08 16:41:10,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 442. [2025-03-08 16:41:10,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 374 states have (on average 1.2887700534759359) internal successors, (482), 377 states have internal predecessors, (482), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:41:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 598 transitions. [2025-03-08 16:41:10,380 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 598 transitions. Word has length 146 [2025-03-08 16:41:10,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:10,380 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 598 transitions. [2025-03-08 16:41:10,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-08 16:41:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 598 transitions. [2025-03-08 16:41:10,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 16:41:10,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:10,381 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:10,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:41:10,382 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:10,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:10,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1679368111, now seen corresponding path program 1 times [2025-03-08 16:41:10,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:10,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812690907] [2025-03-08 16:41:10,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:10,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:10,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 16:41:10,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 16:41:10,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:10,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:10,928 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:41:10,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:10,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812690907] [2025-03-08 16:41:10,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812690907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:41:10,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:41:10,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:41:10,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486353785] [2025-03-08 16:41:10,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:41:10,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:41:10,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:10,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:41:10,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:41:10,930 INFO L87 Difference]: Start difference. First operand 442 states and 598 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:41:11,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:11,338 INFO L93 Difference]: Finished difference Result 889 states and 1199 transitions. [2025-03-08 16:41:11,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:41:11,340 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2025-03-08 16:41:11,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:11,342 INFO L225 Difference]: With dead ends: 889 [2025-03-08 16:41:11,342 INFO L226 Difference]: Without dead ends: 450 [2025-03-08 16:41:11,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:41:11,343 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 200 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:11,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1408 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:41:11,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-03-08 16:41:11,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 442. [2025-03-08 16:41:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 374 states have (on average 1.286096256684492) internal successors, (481), 377 states have internal predecessors, (481), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:41:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 597 transitions. [2025-03-08 16:41:11,375 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 597 transitions. Word has length 146 [2025-03-08 16:41:11,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:11,375 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 597 transitions. [2025-03-08 16:41:11,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:41:11,375 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 597 transitions. [2025-03-08 16:41:11,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 16:41:11,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:11,376 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:11,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:41:11,377 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:11,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:11,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2140051041, now seen corresponding path program 1 times [2025-03-08 16:41:11,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:11,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42031480] [2025-03-08 16:41:11,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:11,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:11,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:41:11,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:41:11,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:11,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:41:11,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:11,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42031480] [2025-03-08 16:41:11,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42031480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:41:11,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443035843] [2025-03-08 16:41:11,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:11,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:41:11,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:41:11,515 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:41:11,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:41:11,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:41:11,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:41:11,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:11,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:11,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:41:11,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:41:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:41:11,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:41:11,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443035843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:41:11,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:41:11,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-08 16:41:11,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412889141] [2025-03-08 16:41:11,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:41:11,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:41:11,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:11,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:41:11,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:41:11,756 INFO L87 Difference]: Start difference. First operand 442 states and 597 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:41:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:11,806 INFO L93 Difference]: Finished difference Result 901 states and 1216 transitions. [2025-03-08 16:41:11,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:41:11,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-03-08 16:41:11,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:11,809 INFO L225 Difference]: With dead ends: 901 [2025-03-08 16:41:11,809 INFO L226 Difference]: Without dead ends: 462 [2025-03-08 16:41:11,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:41:11,810 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:11,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 725 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:41:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-08 16:41:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 456. [2025-03-08 16:41:11,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 388 states have (on average 1.2757731958762886) internal successors, (495), 391 states have internal predecessors, (495), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:41:11,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 611 transitions. [2025-03-08 16:41:11,843 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 611 transitions. Word has length 147 [2025-03-08 16:41:11,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:11,843 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 611 transitions. [2025-03-08 16:41:11,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:41:11,843 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 611 transitions. [2025-03-08 16:41:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 16:41:11,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:11,845 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:11,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 16:41:12,045 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,SelfDestructingSolverStorable11 [2025-03-08 16:41:12,045 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:12,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:12,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1041979725, now seen corresponding path program 1 times [2025-03-08 16:41:12,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:12,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242682556] [2025-03-08 16:41:12,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:12,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:12,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:41:12,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:41:12,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:12,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:12,182 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:41:12,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:12,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242682556] [2025-03-08 16:41:12,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242682556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:41:12,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799443506] [2025-03-08 16:41:12,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:12,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:41:12,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:41:12,184 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:41:12,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 16:41:12,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:41:12,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:41:12,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:12,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:12,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:41:12,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:41:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:41:12,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:41:12,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799443506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:41:12,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:41:12,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 16:41:12,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981454797] [2025-03-08 16:41:12,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:41:12,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:41:12,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:12,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:41:12,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:41:12,412 INFO L87 Difference]: Start difference. First operand 456 states and 611 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:41:12,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:12,449 INFO L93 Difference]: Finished difference Result 924 states and 1239 transitions. [2025-03-08 16:41:12,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:41:12,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-03-08 16:41:12,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:12,452 INFO L225 Difference]: With dead ends: 924 [2025-03-08 16:41:12,452 INFO L226 Difference]: Without dead ends: 471 [2025-03-08 16:41:12,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:41:12,453 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:12,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 576 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:41:12,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-08 16:41:12,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2025-03-08 16:41:12,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 403 states have (on average 1.2655086848635235) internal successors, (510), 406 states have internal predecessors, (510), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:41:12,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 626 transitions. [2025-03-08 16:41:12,480 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 626 transitions. Word has length 147 [2025-03-08 16:41:12,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:12,480 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 626 transitions. [2025-03-08 16:41:12,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:41:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 626 transitions. [2025-03-08 16:41:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:41:12,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:12,482 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:12,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 16:41:12,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:41:12,682 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:12,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:12,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1639988658, now seen corresponding path program 1 times [2025-03-08 16:41:12,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:12,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210930447] [2025-03-08 16:41:12,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:12,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:12,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:41:12,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:41:12,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:12,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:41:14,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:14,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210930447] [2025-03-08 16:41:14,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210930447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:41:14,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:41:14,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-08 16:41:14,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46062438] [2025-03-08 16:41:14,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:41:14,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 16:41:14,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:14,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 16:41:14,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-03-08 16:41:14,312 INFO L87 Difference]: Start difference. First operand 471 states and 626 transitions. Second operand has 21 states, 18 states have (on average 3.388888888888889) internal successors, (61), 20 states have internal predecessors, (61), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-08 16:41:15,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:15,510 INFO L93 Difference]: Finished difference Result 734 states and 973 transitions. [2025-03-08 16:41:15,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 16:41:15,510 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 3.388888888888889) internal successors, (61), 20 states have internal predecessors, (61), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) Word has length 148 [2025-03-08 16:41:15,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:15,513 INFO L225 Difference]: With dead ends: 734 [2025-03-08 16:41:15,513 INFO L226 Difference]: Without dead ends: 519 [2025-03-08 16:41:15,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=212, Invalid=978, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 16:41:15,514 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 389 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:15,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1639 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:41:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-08 16:41:15,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 513. [2025-03-08 16:41:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 442 states have (on average 1.2647058823529411) internal successors, (559), 446 states have internal predecessors, (559), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 16:41:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 679 transitions. [2025-03-08 16:41:15,547 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 679 transitions. Word has length 148 [2025-03-08 16:41:15,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:15,548 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 679 transitions. [2025-03-08 16:41:15,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 3.388888888888889) internal successors, (61), 20 states have internal predecessors, (61), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-08 16:41:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 679 transitions. [2025-03-08 16:41:15,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:41:15,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:15,551 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:15,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 16:41:15,551 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:15,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:15,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1231164433, now seen corresponding path program 1 times [2025-03-08 16:41:15,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:15,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619675535] [2025-03-08 16:41:15,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:15,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:15,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:41:15,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:41:15,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:15,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:41:16,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:16,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619675535] [2025-03-08 16:41:16,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619675535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:41:16,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:41:16,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 16:41:16,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030653147] [2025-03-08 16:41:16,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:41:16,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 16:41:16,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:16,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 16:41:16,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:41:16,408 INFO L87 Difference]: Start difference. First operand 513 states and 679 transitions. Second operand has 17 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-08 16:41:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:17,051 INFO L93 Difference]: Finished difference Result 844 states and 1117 transitions. [2025-03-08 16:41:17,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:41:17,052 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 148 [2025-03-08 16:41:17,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:17,055 INFO L225 Difference]: With dead ends: 844 [2025-03-08 16:41:17,055 INFO L226 Difference]: Without dead ends: 587 [2025-03-08 16:41:17,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2025-03-08 16:41:17,057 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 439 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:17,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1560 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:41:17,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-03-08 16:41:17,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 515. [2025-03-08 16:41:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 444 states have (on average 1.2635135135135136) internal successors, (561), 448 states have internal predecessors, (561), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 16:41:17,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 681 transitions. [2025-03-08 16:41:17,108 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 681 transitions. Word has length 148 [2025-03-08 16:41:17,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:17,108 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 681 transitions. [2025-03-08 16:41:17,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-08 16:41:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 681 transitions. [2025-03-08 16:41:17,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:41:17,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:17,111 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:17,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 16:41:17,111 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:17,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:17,111 INFO L85 PathProgramCache]: Analyzing trace with hash -565786926, now seen corresponding path program 1 times [2025-03-08 16:41:17,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:17,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322071304] [2025-03-08 16:41:17,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:17,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:17,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:41:17,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:41:17,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:17,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:41:17,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:17,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322071304] [2025-03-08 16:41:17,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322071304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:41:17,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:41:17,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 16:41:17,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879611297] [2025-03-08 16:41:17,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:41:17,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:41:17,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:17,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:41:17,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:41:17,989 INFO L87 Difference]: Start difference. First operand 515 states and 681 transitions. Second operand has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 15 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-08 16:41:18,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:18,723 INFO L93 Difference]: Finished difference Result 778 states and 1027 transitions. [2025-03-08 16:41:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:41:18,724 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 15 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) Word has length 148 [2025-03-08 16:41:18,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:18,727 INFO L225 Difference]: With dead ends: 778 [2025-03-08 16:41:18,727 INFO L226 Difference]: Without dead ends: 519 [2025-03-08 16:41:18,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2025-03-08 16:41:18,729 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 372 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:18,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1395 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:41:18,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-08 16:41:18,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 514. [2025-03-08 16:41:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 443 states have (on average 1.2618510158013545) internal successors, (559), 447 states have internal predecessors, (559), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 16:41:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 679 transitions. [2025-03-08 16:41:18,759 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 679 transitions. Word has length 148 [2025-03-08 16:41:18,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:18,760 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 679 transitions. [2025-03-08 16:41:18,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 15 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-08 16:41:18,760 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 679 transitions. [2025-03-08 16:41:18,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 16:41:18,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:18,761 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:18,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 16:41:18,761 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:18,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:18,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1314523446, now seen corresponding path program 1 times [2025-03-08 16:41:18,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:18,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250120528] [2025-03-08 16:41:18,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:18,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:18,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:41:18,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:41:18,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:18,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:41:18,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:18,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250120528] [2025-03-08 16:41:18,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250120528] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:41:18,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512110711] [2025-03-08 16:41:18,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:18,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:41:18,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:41:18,888 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:41:18,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 16:41:19,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:41:19,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:41:19,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:19,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:19,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 16:41:19,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:41:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:41:19,142 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:41:19,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512110711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:41:19,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:41:19,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2025-03-08 16:41:19,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700625409] [2025-03-08 16:41:19,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:41:19,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:41:19,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:19,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:41:19,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:41:19,144 INFO L87 Difference]: Start difference. First operand 514 states and 679 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:41:19,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:19,197 INFO L93 Difference]: Finished difference Result 1061 states and 1397 transitions. [2025-03-08 16:41:19,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:41:19,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-03-08 16:41:19,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:19,200 INFO L225 Difference]: With dead ends: 1061 [2025-03-08 16:41:19,200 INFO L226 Difference]: Without dead ends: 550 [2025-03-08 16:41:19,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:41:19,201 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:19,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 865 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:41:19,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-08 16:41:19,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 520. [2025-03-08 16:41:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 449 states have (on average 1.2583518930957684) internal successors, (565), 453 states have internal predecessors, (565), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 16:41:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 685 transitions. [2025-03-08 16:41:19,232 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 685 transitions. Word has length 149 [2025-03-08 16:41:19,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:19,232 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 685 transitions. [2025-03-08 16:41:19,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:41:19,233 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 685 transitions. [2025-03-08 16:41:19,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 16:41:19,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:19,234 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:19,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 16:41:19,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 16:41:19,435 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:19,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:19,435 INFO L85 PathProgramCache]: Analyzing trace with hash 917887184, now seen corresponding path program 1 times [2025-03-08 16:41:19,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:19,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935979882] [2025-03-08 16:41:19,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:19,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:19,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:41:19,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:41:19,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:19,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:41:19,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:19,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935979882] [2025-03-08 16:41:19,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935979882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:41:19,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:41:19,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:41:19,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590371335] [2025-03-08 16:41:19,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:41:19,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:41:19,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:19,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:41:19,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:41:19,653 INFO L87 Difference]: Start difference. First operand 520 states and 685 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:41:19,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:19,767 INFO L93 Difference]: Finished difference Result 1219 states and 1596 transitions. [2025-03-08 16:41:19,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:41:19,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-03-08 16:41:19,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:19,771 INFO L225 Difference]: With dead ends: 1219 [2025-03-08 16:41:19,771 INFO L226 Difference]: Without dead ends: 702 [2025-03-08 16:41:19,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:41:19,772 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 58 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:19,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 575 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:41:19,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-03-08 16:41:19,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 586. [2025-03-08 16:41:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 513 states have (on average 1.2612085769980508) internal successors, (647), 517 states have internal predecessors, (647), 60 states have call successors, (60), 12 states have call predecessors, (60), 12 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 16:41:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 767 transitions. [2025-03-08 16:41:19,805 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 767 transitions. Word has length 149 [2025-03-08 16:41:19,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:19,805 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 767 transitions. [2025-03-08 16:41:19,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:41:19,805 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 767 transitions. [2025-03-08 16:41:19,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 16:41:19,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:19,806 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:19,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 16:41:19,806 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:19,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:19,807 INFO L85 PathProgramCache]: Analyzing trace with hash -211263349, now seen corresponding path program 1 times [2025-03-08 16:41:19,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:19,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896547223] [2025-03-08 16:41:19,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:19,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:19,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:41:19,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:41:19,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:19,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:41:20,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:20,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896547223] [2025-03-08 16:41:20,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896547223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:41:20,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:41:20,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:41:20,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286434051] [2025-03-08 16:41:20,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:41:20,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:41:20,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:20,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:41:20,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:41:20,317 INFO L87 Difference]: Start difference. First operand 586 states and 767 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:41:20,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:20,470 INFO L93 Difference]: Finished difference Result 1145 states and 1488 transitions. [2025-03-08 16:41:20,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:41:20,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-03-08 16:41:20,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:20,474 INFO L225 Difference]: With dead ends: 1145 [2025-03-08 16:41:20,474 INFO L226 Difference]: Without dead ends: 1143 [2025-03-08 16:41:20,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:41:20,475 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 96 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:20,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1085 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:41:20,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2025-03-08 16:41:20,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 829. [2025-03-08 16:41:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 756 states have (on average 1.2671957671957672) internal successors, (958), 760 states have internal predecessors, (958), 60 states have call successors, (60), 12 states have call predecessors, (60), 12 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 16:41:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1078 transitions. [2025-03-08 16:41:20,518 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1078 transitions. Word has length 149 [2025-03-08 16:41:20,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:20,519 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1078 transitions. [2025-03-08 16:41:20,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:41:20,519 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1078 transitions. [2025-03-08 16:41:20,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 16:41:20,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:20,520 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:20,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 16:41:20,521 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:20,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:20,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1029880525, now seen corresponding path program 1 times [2025-03-08 16:41:20,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:20,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251789675] [2025-03-08 16:41:20,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:20,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:20,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:41:20,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:41:20,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:20,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:41:21,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:21,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251789675] [2025-03-08 16:41:21,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251789675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:41:21,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:41:21,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 16:41:21,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964982867] [2025-03-08 16:41:21,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:41:21,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:41:21,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:21,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:41:21,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:41:21,177 INFO L87 Difference]: Start difference. First operand 829 states and 1078 transitions. Second operand has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 13 states have internal predecessors, (64), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:41:21,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:21,665 INFO L93 Difference]: Finished difference Result 1504 states and 1958 transitions. [2025-03-08 16:41:21,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:41:21,666 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 13 states have internal predecessors, (64), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 151 [2025-03-08 16:41:21,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:21,669 INFO L225 Difference]: With dead ends: 1504 [2025-03-08 16:41:21,669 INFO L226 Difference]: Without dead ends: 966 [2025-03-08 16:41:21,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:41:21,674 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 300 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:21,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 2005 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:41:21,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2025-03-08 16:41:21,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 948. [2025-03-08 16:41:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 845 states have (on average 1.2627218934911242) internal successors, (1067), 851 states have internal predecessors, (1067), 84 states have call successors, (84), 18 states have call predecessors, (84), 18 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 16:41:21,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1235 transitions. [2025-03-08 16:41:21,730 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1235 transitions. Word has length 151 [2025-03-08 16:41:21,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:21,730 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1235 transitions. [2025-03-08 16:41:21,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 13 states have internal predecessors, (64), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:41:21,730 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1235 transitions. [2025-03-08 16:41:21,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 16:41:21,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:21,732 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:21,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 16:41:21,732 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:21,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:21,732 INFO L85 PathProgramCache]: Analyzing trace with hash 557201806, now seen corresponding path program 1 times [2025-03-08 16:41:21,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:21,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108352390] [2025-03-08 16:41:21,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:21,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:21,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:41:21,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:41:21,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:21,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:22,239 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:41:22,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:22,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108352390] [2025-03-08 16:41:22,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108352390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:41:22,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879814594] [2025-03-08 16:41:22,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:22,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:41:22,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:41:22,241 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:41:22,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 16:41:22,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:41:22,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:41:22,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:22,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:22,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 16:41:22,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:41:22,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:41:23,275 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 20 proven. 222 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-08 16:41:23,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:41:23,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-03-08 16:41:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 15 proven. 84 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-08 16:41:23,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879814594] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:41:23,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:41:23,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2025-03-08 16:41:23,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111638004] [2025-03-08 16:41:23,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:41:23,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 16:41:23,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:23,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 16:41:23,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=978, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 16:41:23,743 INFO L87 Difference]: Start difference. First operand 948 states and 1235 transitions. Second operand has 35 states, 30 states have (on average 5.833333333333333) internal successors, (175), 31 states have internal predecessors, (175), 10 states have call successors, (54), 4 states have call predecessors, (54), 8 states have return successors, (54), 8 states have call predecessors, (54), 10 states have call successors, (54) [2025-03-08 16:41:25,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:25,187 INFO L93 Difference]: Finished difference Result 1965 states and 2530 transitions. [2025-03-08 16:41:25,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-08 16:41:25,188 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 30 states have (on average 5.833333333333333) internal successors, (175), 31 states have internal predecessors, (175), 10 states have call successors, (54), 4 states have call predecessors, (54), 8 states have return successors, (54), 8 states have call predecessors, (54), 10 states have call successors, (54) Word has length 151 [2025-03-08 16:41:25,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:25,191 INFO L225 Difference]: With dead ends: 1965 [2025-03-08 16:41:25,191 INFO L226 Difference]: Without dead ends: 1020 [2025-03-08 16:41:25,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=798, Invalid=3362, Unknown=0, NotChecked=0, Total=4160 [2025-03-08 16:41:25,193 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 872 mSDsluCounter, 1645 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:25,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 1755 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:41:25,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2025-03-08 16:41:25,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 975. [2025-03-08 16:41:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 860 states have (on average 1.255813953488372) internal successors, (1080), 866 states have internal predecessors, (1080), 84 states have call successors, (84), 30 states have call predecessors, (84), 30 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 16:41:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1248 transitions. [2025-03-08 16:41:25,275 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1248 transitions. Word has length 151 [2025-03-08 16:41:25,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:25,275 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1248 transitions. [2025-03-08 16:41:25,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 30 states have (on average 5.833333333333333) internal successors, (175), 31 states have internal predecessors, (175), 10 states have call successors, (54), 4 states have call predecessors, (54), 8 states have return successors, (54), 8 states have call predecessors, (54), 10 states have call successors, (54) [2025-03-08 16:41:25,276 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1248 transitions. [2025-03-08 16:41:25,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 16:41:25,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:25,277 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:25,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 16:41:25,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:41:25,478 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:25,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:25,478 INFO L85 PathProgramCache]: Analyzing trace with hash -985449200, now seen corresponding path program 1 times [2025-03-08 16:41:25,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:25,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206882447] [2025-03-08 16:41:25,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:25,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:25,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:41:25,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:41:25,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:25,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:41:25,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:25,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206882447] [2025-03-08 16:41:25,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206882447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:41:25,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147455925] [2025-03-08 16:41:25,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:25,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:41:25,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:41:25,920 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:41:25,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 16:41:26,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:41:26,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:41:26,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:26,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:26,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 16:41:26,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:41:26,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:41:26,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 16:41:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 17 proven. 51 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:41:26,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:41:26,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-03-08 16:41:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:41:26,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147455925] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:41:26,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:41:26,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2025-03-08 16:41:26,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119322149] [2025-03-08 16:41:26,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:41:26,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 16:41:26,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:26,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 16:41:26,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-03-08 16:41:26,688 INFO L87 Difference]: Start difference. First operand 975 states and 1248 transitions. Second operand has 21 states, 18 states have (on average 9.166666666666666) internal successors, (165), 21 states have internal predecessors, (165), 6 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (54), 3 states have call predecessors, (54), 6 states have call successors, (54) [2025-03-08 16:41:27,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:27,399 INFO L93 Difference]: Finished difference Result 1974 states and 2502 transitions. [2025-03-08 16:41:27,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 16:41:27,400 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 9.166666666666666) internal successors, (165), 21 states have internal predecessors, (165), 6 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (54), 3 states have call predecessors, (54), 6 states have call successors, (54) Word has length 151 [2025-03-08 16:41:27,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:27,403 INFO L225 Difference]: With dead ends: 1974 [2025-03-08 16:41:27,403 INFO L226 Difference]: Without dead ends: 1002 [2025-03-08 16:41:27,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=1548, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 16:41:27,405 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 431 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:27,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1284 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:41:27,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2025-03-08 16:41:27,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 950. [2025-03-08 16:41:27,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 827 states have (on average 1.2454655380894801) internal successors, (1030), 833 states have internal predecessors, (1030), 84 states have call successors, (84), 38 states have call predecessors, (84), 38 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 16:41:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1198 transitions. [2025-03-08 16:41:27,485 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1198 transitions. Word has length 151 [2025-03-08 16:41:27,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:27,486 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1198 transitions. [2025-03-08 16:41:27,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 9.166666666666666) internal successors, (165), 21 states have internal predecessors, (165), 6 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (54), 3 states have call predecessors, (54), 6 states have call successors, (54) [2025-03-08 16:41:27,486 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1198 transitions. [2025-03-08 16:41:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 16:41:27,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:27,487 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:27,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 16:41:27,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:41:27,688 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:27,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:27,688 INFO L85 PathProgramCache]: Analyzing trace with hash 221711416, now seen corresponding path program 1 times [2025-03-08 16:41:27,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:27,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43268246] [2025-03-08 16:41:27,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:27,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:27,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:41:27,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:41:27,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:27,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:28,053 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:41:28,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:28,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43268246] [2025-03-08 16:41:28,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43268246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:41:28,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196681177] [2025-03-08 16:41:28,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:28,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:41:28,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:41:28,056 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:41:28,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 16:41:28,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:41:28,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:41:28,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:28,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:28,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 16:41:28,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:41:28,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:41:28,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-08 16:41:28,498 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 13 treesize of output 9 [2025-03-08 16:41:28,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 16:41:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 10 proven. 338 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:41:28,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:41:28,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-03-08 16:41:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:41:28,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196681177] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:41:28,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:41:28,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2025-03-08 16:41:28,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047864984] [2025-03-08 16:41:28,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:41:28,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 16:41:28,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:28,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 16:41:28,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:41:28,751 INFO L87 Difference]: Start difference. First operand 950 states and 1198 transitions. Second operand has 19 states, 15 states have (on average 8.6) internal successors, (129), 18 states have internal predecessors, (129), 8 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 5 states have call predecessors, (54), 8 states have call successors, (54) [2025-03-08 16:41:29,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:29,350 INFO L93 Difference]: Finished difference Result 1841 states and 2291 transitions. [2025-03-08 16:41:29,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 16:41:29,350 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 8.6) internal successors, (129), 18 states have internal predecessors, (129), 8 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 5 states have call predecessors, (54), 8 states have call successors, (54) Word has length 152 [2025-03-08 16:41:29,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:29,353 INFO L225 Difference]: With dead ends: 1841 [2025-03-08 16:41:29,353 INFO L226 Difference]: Without dead ends: 894 [2025-03-08 16:41:29,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 296 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=970, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 16:41:29,355 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 546 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:29,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 753 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:41:29,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-03-08 16:41:29,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 864. [2025-03-08 16:41:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 735 states have (on average 1.2081632653061225) internal successors, (888), 741 states have internal predecessors, (888), 84 states have call successors, (84), 44 states have call predecessors, (84), 44 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 16:41:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1056 transitions. [2025-03-08 16:41:29,450 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1056 transitions. Word has length 152 [2025-03-08 16:41:29,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:29,450 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1056 transitions. [2025-03-08 16:41:29,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 8.6) internal successors, (129), 18 states have internal predecessors, (129), 8 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 5 states have call predecessors, (54), 8 states have call successors, (54) [2025-03-08 16:41:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1056 transitions. [2025-03-08 16:41:29,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 16:41:29,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:29,451 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:29,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 16:41:29,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:41:29,653 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:29,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:29,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1651651696, now seen corresponding path program 1 times [2025-03-08 16:41:29,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:29,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177694991] [2025-03-08 16:41:29,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:29,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:29,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 16:41:29,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 16:41:29,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:29,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:30,510 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 84 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2025-03-08 16:41:30,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:30,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177694991] [2025-03-08 16:41:30,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177694991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:41:30,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731002162] [2025-03-08 16:41:30,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:30,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:41:30,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:41:30,513 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:41:30,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 16:41:30,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 16:41:31,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 16:41:31,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:31,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:31,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-08 16:41:31,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:41:31,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-08 16:41:31,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:41:32,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:41:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 496 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 16:41:32,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:41:33,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2025-03-08 16:41:33,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 142 [2025-03-08 16:41:49,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731002162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:41:49,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:41:49,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 38 [2025-03-08 16:41:49,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364720501] [2025-03-08 16:41:49,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:41:49,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 16:41:49,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:49,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 16:41:49,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=2959, Unknown=1, NotChecked=0, Total=3306 [2025-03-08 16:41:49,362 INFO L87 Difference]: Start difference. First operand 864 states and 1056 transitions. Second operand has 38 states, 30 states have (on average 4.166666666666667) internal successors, (125), 30 states have internal predecessors, (125), 16 states have call successors, (36), 9 states have call predecessors, (36), 10 states have return successors, (36), 12 states have call predecessors, (36), 16 states have call successors, (36) [2025-03-08 16:41:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:51,302 INFO L93 Difference]: Finished difference Result 1333 states and 1616 transitions. [2025-03-08 16:41:51,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 16:41:51,303 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 30 states have (on average 4.166666666666667) internal successors, (125), 30 states have internal predecessors, (125), 16 states have call successors, (36), 9 states have call predecessors, (36), 10 states have return successors, (36), 12 states have call predecessors, (36), 16 states have call successors, (36) Word has length 154 [2025-03-08 16:41:51,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:51,305 INFO L225 Difference]: With dead ends: 1333 [2025-03-08 16:41:51,305 INFO L226 Difference]: Without dead ends: 472 [2025-03-08 16:41:51,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1436 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=1317, Invalid=6164, Unknown=1, NotChecked=0, Total=7482 [2025-03-08 16:41:51,307 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 1141 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:51,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 1442 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:41:51,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-03-08 16:41:51,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 372. [2025-03-08 16:41:51,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 301 states have (on average 1.1926910299003322) internal successors, (359), 303 states have internal predecessors, (359), 46 states have call successors, (46), 24 states have call predecessors, (46), 24 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 16:41:51,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 451 transitions. [2025-03-08 16:41:51,355 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 451 transitions. Word has length 154 [2025-03-08 16:41:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:51,356 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 451 transitions. [2025-03-08 16:41:51,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 30 states have (on average 4.166666666666667) internal successors, (125), 30 states have internal predecessors, (125), 16 states have call successors, (36), 9 states have call predecessors, (36), 10 states have return successors, (36), 12 states have call predecessors, (36), 16 states have call successors, (36) [2025-03-08 16:41:51,356 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 451 transitions. [2025-03-08 16:41:51,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:41:51,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:51,357 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:51,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 16:41:51,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-08 16:41:51,558 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:51,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:51,558 INFO L85 PathProgramCache]: Analyzing trace with hash -185302729, now seen corresponding path program 1 times [2025-03-08 16:41:51,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:51,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154507227] [2025-03-08 16:41:51,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:51,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:51,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:41:51,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:41:51,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:51,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:41:51,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:51,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154507227] [2025-03-08 16:41:51,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154507227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:41:51,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:41:51,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:41:51,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903748683] [2025-03-08 16:41:51,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:41:51,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:41:51,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:51,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:41:51,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:41:51,777 INFO L87 Difference]: Start difference. First operand 372 states and 451 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:41:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:51,869 INFO L93 Difference]: Finished difference Result 662 states and 804 transitions. [2025-03-08 16:41:51,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:41:51,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 155 [2025-03-08 16:41:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:51,871 INFO L225 Difference]: With dead ends: 662 [2025-03-08 16:41:51,871 INFO L226 Difference]: Without dead ends: 372 [2025-03-08 16:41:51,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:41:51,872 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 48 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:51,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 436 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:41:51,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-08 16:41:51,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-03-08 16:41:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 301 states have (on average 1.1827242524916943) internal successors, (356), 303 states have internal predecessors, (356), 46 states have call successors, (46), 24 states have call predecessors, (46), 24 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 16:41:51,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 448 transitions. [2025-03-08 16:41:51,920 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 448 transitions. Word has length 155 [2025-03-08 16:41:51,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:51,920 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 448 transitions. [2025-03-08 16:41:51,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:41:51,920 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 448 transitions. [2025-03-08 16:41:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 16:41:51,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:51,921 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:51,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 16:41:51,921 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:51,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:51,921 INFO L85 PathProgramCache]: Analyzing trace with hash -26758918, now seen corresponding path program 1 times [2025-03-08 16:41:51,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:51,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736704973] [2025-03-08 16:41:51,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:51,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:51,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 16:41:51,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 16:41:51,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:51,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:41:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:41:52,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:41:52,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736704973] [2025-03-08 16:41:52,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736704973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:41:52,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:41:52,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:41:52,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117250382] [2025-03-08 16:41:52,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:41:52,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:41:52,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:41:52,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:41:52,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:41:52,782 INFO L87 Difference]: Start difference. First operand 372 states and 448 transitions. Second operand has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:41:53,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:41:53,594 INFO L93 Difference]: Finished difference Result 671 states and 807 transitions. [2025-03-08 16:41:53,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:41:53,595 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 157 [2025-03-08 16:41:53,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:41:53,596 INFO L225 Difference]: With dead ends: 671 [2025-03-08 16:41:53,596 INFO L226 Difference]: Without dead ends: 365 [2025-03-08 16:41:53,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:41:53,597 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 297 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:41:53,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1302 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:41:53,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-08 16:41:53,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2025-03-08 16:41:53,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 294 states have (on average 1.1802721088435375) internal successors, (347), 296 states have internal predecessors, (347), 46 states have call successors, (46), 24 states have call predecessors, (46), 24 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 16:41:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 439 transitions. [2025-03-08 16:41:53,646 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 439 transitions. Word has length 157 [2025-03-08 16:41:53,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:41:53,646 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 439 transitions. [2025-03-08 16:41:53,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:41:53,646 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 439 transitions. [2025-03-08 16:41:53,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 16:41:53,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:41:53,647 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:41:53,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 16:41:53,649 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:41:53,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:41:53,649 INFO L85 PathProgramCache]: Analyzing trace with hash 934855099, now seen corresponding path program 1 times [2025-03-08 16:41:53,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:41:53,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113243752] [2025-03-08 16:41:53,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:41:53,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:41:53,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 16:41:53,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 16:41:53,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:41:53,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat