./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-90.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 9c6e745fb3369f6d50167657c14f10731407b128ae2baded15d3743683fdbf24 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:52:03,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:52:03,783 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:52:03,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:52:03,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:52:03,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:52:03,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:52:03,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:52:03,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:52:03,809 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:52:03,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:52:03,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:52:03,810 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:52:03,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:52:03,810 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:52:03,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:52:03,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:52:03,811 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:52:03,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:52:03,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:52:03,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:52:03,811 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:52:03,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:52:03,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:52:03,811 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:52:03,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:52:03,811 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:52:03,811 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:52:03,811 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:52:03,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:52:03,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:52:03,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:52:03,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:52:03,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:52:03,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:52:03,812 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:52:03,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:52:03,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:52:03,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:52:03,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:52:03,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:52:03,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:52:03,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:52:03,813 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 -> 9c6e745fb3369f6d50167657c14f10731407b128ae2baded15d3743683fdbf24 [2025-03-17 05:52:04,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:52:04,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:52:04,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:52:04,015 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:52:04,015 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:52:04,019 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-90.i [2025-03-17 05:52:05,142 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a2fe33c6/62198426091a4f6c9a068242fc30842e/FLAGc180ad02f [2025-03-17 05:52:05,452 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:52:05,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-90.i [2025-03-17 05:52:05,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a2fe33c6/62198426091a4f6c9a068242fc30842e/FLAGc180ad02f [2025-03-17 05:52:05,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a2fe33c6/62198426091a4f6c9a068242fc30842e [2025-03-17 05:52:05,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:52:05,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:52:05,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:52:05,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:52:05,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:52:05,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:52:05" (1/1) ... [2025-03-17 05:52:05,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:52:05, skipping insertion in model container [2025-03-17 05:52:05,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:52:05" (1/1) ... [2025-03-17 05:52:05,753 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:52:05,862 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-90.i[916,929] [2025-03-17 05:52:05,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:52:05,928 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:52:05,935 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-90.i[916,929] [2025-03-17 05:52:05,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:52:05,982 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:52:05,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:52:05 WrapperNode [2025-03-17 05:52:05,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:52:05,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:52:05,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:52:05,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:52:05,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:52:05" (1/1) ... [2025-03-17 05:52:05,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:52:05" (1/1) ... [2025-03-17 05:52:06,013 INFO L138 Inliner]: procedures = 26, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 503 [2025-03-17 05:52:06,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:52:06,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:52:06,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:52:06,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:52:06,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:52:05" (1/1) ... [2025-03-17 05:52:06,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:52:05" (1/1) ... [2025-03-17 05:52:06,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:52:05" (1/1) ... [2025-03-17 05:52:06,037 INFO L175 MemorySlicer]: Split 130 memory accesses to 16 slices as follows [2, 3, 6, 16, 8, 12, 13, 8, 14, 8, 6, 8, 6, 4, 12, 4]. 12 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 19 writes are split as follows [0, 1, 1, 1, 1, 1, 4, 1, 1, 2, 1, 1, 1, 1, 1, 1]. [2025-03-17 05:52:06,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:52:05" (1/1) ... [2025-03-17 05:52:06,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:52:05" (1/1) ... [2025-03-17 05:52:06,053 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:52:05" (1/1) ... [2025-03-17 05:52:06,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:52:05" (1/1) ... [2025-03-17 05:52:06,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:52:05" (1/1) ... [2025-03-17 05:52:06,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:52:05" (1/1) ... [2025-03-17 05:52:06,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:52:06,071 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:52:06,071 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:52:06,072 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:52:06,072 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:52:05" (1/1) ... [2025-03-17 05:52:06,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:52:06,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:52:06,098 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:52:06,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:52:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:52:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:52:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:52:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:52:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:52:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:52:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:52:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:52:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:52:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 05:52:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 05:52:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 05:52:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 05:52:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-17 05:52:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-17 05:52:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-17 05:52:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-17 05:52:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:52:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:52:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:52:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:52:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:52:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:52:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:52:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:52:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 05:52:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 05:52:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 05:52:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 05:52:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-17 05:52:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-17 05:52:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-17 05:52:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-17 05:52:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:52:06,119 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:52:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:52:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:52:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:52:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:52:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:52:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:52:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:52:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:52:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 05:52:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 05:52:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 05:52:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 05:52:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-17 05:52:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-17 05:52:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-17 05:52:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-17 05:52:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:52:06,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:52:06,251 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:52:06,253 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:52:06,651 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc property_#t~mem73#1;havoc property_#t~ite82#1;havoc property_#t~mem81#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~ite80#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite100#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite97#1;havoc property_#t~ite94#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem96#1;havoc property_#t~mem95#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~ite111#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~short105#1;havoc property_#t~mem110#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~short109#1;havoc property_#t~short112#1;havoc property_#t~mem118#1;havoc property_#t~mem114#1;havoc property_#t~mem113#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite127#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short128#1; [2025-03-17 05:52:06,696 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2025-03-17 05:52:06,697 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:52:06,705 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:52:06,705 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:52:06,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:52:06 BoogieIcfgContainer [2025-03-17 05:52:06,705 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:52:06,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:52:06,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:52:06,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:52:06,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:52:05" (1/3) ... [2025-03-17 05:52:06,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ce8515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:52:06, skipping insertion in model container [2025-03-17 05:52:06,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:52:05" (2/3) ... [2025-03-17 05:52:06,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ce8515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:52:06, skipping insertion in model container [2025-03-17 05:52:06,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:52:06" (3/3) ... [2025-03-17 05:52:06,712 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-90.i [2025-03-17 05:52:06,727 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:52:06,730 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-90.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:52:06,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:52:06,778 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;@55a5c67f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:52:06,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:52:06,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 83 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:52:06,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:52:06,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:06,789 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:06,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:06,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:06,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1792362862, now seen corresponding path program 1 times [2025-03-17 05:52:06,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:06,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124970163] [2025-03-17 05:52:06,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:06,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:06,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:52:06,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:52:06,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:06,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:07,103 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 05:52:07,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:07,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124970163] [2025-03-17 05:52:07,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124970163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:52:07,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215443854] [2025-03-17 05:52:07,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:07,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:52:07,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:52:07,113 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:52:07,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:52:07,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:52:07,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:52:07,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:07,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:07,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:52:07,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:52:07,366 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 05:52:07,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:52:07,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215443854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:07,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:52:07,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:52:07,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230403148] [2025-03-17 05:52:07,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:07,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:52:07,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:07,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:52:07,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:52:07,401 INFO L87 Difference]: Start difference. First operand has 105 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 83 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:52:07,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:07,431 INFO L93 Difference]: Finished difference Result 207 states and 326 transitions. [2025-03-17 05:52:07,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:52:07,433 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 149 [2025-03-17 05:52:07,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:07,437 INFO L225 Difference]: With dead ends: 207 [2025-03-17 05:52:07,438 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 05:52:07,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:52:07,442 INFO L435 NwaCegarLoop]: 150 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, 150 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-17 05:52:07,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:52:07,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 05:52:07,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-17 05:52:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:52:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2025-03-17 05:52:07,484 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 149 [2025-03-17 05:52:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:07,485 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2025-03-17 05:52:07,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:52:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2025-03-17 05:52:07,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:52:07,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:07,490 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:07,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:52:07,691 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-17 05:52:07,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:07,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:07,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1587771390, now seen corresponding path program 1 times [2025-03-17 05:52:07,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:07,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945476030] [2025-03-17 05:52:07,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:07,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:07,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:52:07,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:52:07,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:07,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:52:08,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:08,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945476030] [2025-03-17 05:52:08,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945476030] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:52:08,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257085334] [2025-03-17 05:52:08,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:08,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:52:08,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:52:08,097 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:52:08,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:52:08,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:52:08,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:52:08,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:08,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:08,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:52:08,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:52:08,352 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:08,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:52:08,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257085334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:08,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:52:08,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 05:52:08,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031860544] [2025-03-17 05:52:08,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:08,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:52:08,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:08,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:52:08,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:52:08,354 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:08,386 INFO L93 Difference]: Finished difference Result 207 states and 302 transitions. [2025-03-17 05:52:08,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:52:08,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 149 [2025-03-17 05:52:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:08,388 INFO L225 Difference]: With dead ends: 207 [2025-03-17 05:52:08,388 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 05:52:08,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:52:08,389 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:08,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:52:08,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 05:52:08,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-17 05:52:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:52:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 152 transitions. [2025-03-17 05:52:08,403 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 152 transitions. Word has length 149 [2025-03-17 05:52:08,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:08,405 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 152 transitions. [2025-03-17 05:52:08,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:08,405 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 152 transitions. [2025-03-17 05:52:08,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:52:08,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:08,407 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:08,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:52:08,607 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,SelfDestructingSolverStorable1 [2025-03-17 05:52:08,607 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:08,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:08,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1228571712, now seen corresponding path program 1 times [2025-03-17 05:52:08,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:08,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205981418] [2025-03-17 05:52:08,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:08,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:08,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:52:08,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:52:08,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:08,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:09,207 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:09,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:09,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205981418] [2025-03-17 05:52:09,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205981418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:09,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:09,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:52:09,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154686617] [2025-03-17 05:52:09,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:09,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:52:09,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:09,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:52:09,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:52:09,211 INFO L87 Difference]: Start difference. First operand 105 states and 152 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:09,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:09,462 INFO L93 Difference]: Finished difference Result 303 states and 439 transitions. [2025-03-17 05:52:09,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:52:09,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 151 [2025-03-17 05:52:09,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:09,464 INFO L225 Difference]: With dead ends: 303 [2025-03-17 05:52:09,464 INFO L226 Difference]: Without dead ends: 199 [2025-03-17 05:52:09,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:52:09,465 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 277 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:09,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 475 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:52:09,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-17 05:52:09,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 107. [2025-03-17 05:52:09,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:52:09,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2025-03-17 05:52:09,481 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 151 [2025-03-17 05:52:09,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:09,481 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2025-03-17 05:52:09,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:09,481 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2025-03-17 05:52:09,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 05:52:09,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:09,484 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:09,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:52:09,485 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:09,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:09,485 INFO L85 PathProgramCache]: Analyzing trace with hash 738144443, now seen corresponding path program 1 times [2025-03-17 05:52:09,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:09,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973860005] [2025-03-17 05:52:09,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:09,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:09,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:52:09,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:52:09,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:09,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:10,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:10,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973860005] [2025-03-17 05:52:10,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973860005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:10,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:10,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:52:10,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983281265] [2025-03-17 05:52:10,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:10,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:52:10,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:10,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:52:10,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:52:10,884 INFO L87 Difference]: Start difference. First operand 107 states and 154 transitions. Second operand has 14 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-17 05:52:11,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:11,650 INFO L93 Difference]: Finished difference Result 298 states and 423 transitions. [2025-03-17 05:52:11,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:52:11,651 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 152 [2025-03-17 05:52:11,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:11,652 INFO L225 Difference]: With dead ends: 298 [2025-03-17 05:52:11,652 INFO L226 Difference]: Without dead ends: 192 [2025-03-17 05:52:11,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:52:11,653 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 387 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:11,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 970 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:52:11,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-17 05:52:11,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2025-03-17 05:52:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 155 states have (on average 1.335483870967742) internal successors, (207), 156 states have internal predecessors, (207), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:52:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 267 transitions. [2025-03-17 05:52:11,682 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 267 transitions. Word has length 152 [2025-03-17 05:52:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:11,683 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 267 transitions. [2025-03-17 05:52:11,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-17 05:52:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 267 transitions. [2025-03-17 05:52:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 05:52:11,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:11,684 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:11,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:52:11,685 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:11,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:11,685 INFO L85 PathProgramCache]: Analyzing trace with hash -671612782, now seen corresponding path program 1 times [2025-03-17 05:52:11,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:11,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135307998] [2025-03-17 05:52:11,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:11,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:11,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 05:52:11,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 05:52:11,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:11,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:12,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:12,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135307998] [2025-03-17 05:52:12,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135307998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:12,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:12,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:52:12,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58266687] [2025-03-17 05:52:12,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:12,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:52:12,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:12,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:52:12,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:52:12,226 INFO L87 Difference]: Start difference. First operand 189 states and 267 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 05:52:12,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:12,450 INFO L93 Difference]: Finished difference Result 384 states and 540 transitions. [2025-03-17 05:52:12,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:52:12,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 153 [2025-03-17 05:52:12,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:12,454 INFO L225 Difference]: With dead ends: 384 [2025-03-17 05:52:12,454 INFO L226 Difference]: Without dead ends: 196 [2025-03-17 05:52:12,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:52:12,456 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 200 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:12,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 678 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:52:12,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-17 05:52:12,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-03-17 05:52:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 161 states have (on average 1.3229813664596273) internal successors, (213), 162 states have internal predecessors, (213), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:52:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 273 transitions. [2025-03-17 05:52:12,486 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 273 transitions. Word has length 153 [2025-03-17 05:52:12,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:12,487 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 273 transitions. [2025-03-17 05:52:12,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 05:52:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 273 transitions. [2025-03-17 05:52:12,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 05:52:12,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:12,488 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:12,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:52:12,488 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:12,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:12,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1326672642, now seen corresponding path program 1 times [2025-03-17 05:52:12,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:12,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998475833] [2025-03-17 05:52:12,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:12,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:12,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 05:52:12,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 05:52:12,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:12,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:13,276 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:13,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:13,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998475833] [2025-03-17 05:52:13,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998475833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:13,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:13,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:52:13,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131813418] [2025-03-17 05:52:13,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:13,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:52:13,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:13,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:52:13,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:52:13,278 INFO L87 Difference]: Start difference. First operand 196 states and 273 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:13,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:13,620 INFO L93 Difference]: Finished difference Result 499 states and 690 transitions. [2025-03-17 05:52:13,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:52:13,621 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2025-03-17 05:52:13,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:13,623 INFO L225 Difference]: With dead ends: 499 [2025-03-17 05:52:13,623 INFO L226 Difference]: Without dead ends: 304 [2025-03-17 05:52:13,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:52:13,625 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 66 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:13,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1409 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:52:13,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-17 05:52:13,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 296. [2025-03-17 05:52:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 255 states have (on average 1.3372549019607842) internal successors, (341), 258 states have internal predecessors, (341), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:52:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 409 transitions. [2025-03-17 05:52:13,658 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 409 transitions. Word has length 153 [2025-03-17 05:52:13,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:13,659 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 409 transitions. [2025-03-17 05:52:13,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:13,659 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 409 transitions. [2025-03-17 05:52:13,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 05:52:13,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:13,662 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:13,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:52:13,662 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:13,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:13,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1832231267, now seen corresponding path program 1 times [2025-03-17 05:52:13,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:13,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958933275] [2025-03-17 05:52:13,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:13,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:13,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 05:52:13,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 05:52:13,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:13,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:13,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:13,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958933275] [2025-03-17 05:52:13,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958933275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:13,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:13,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:52:13,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330192239] [2025-03-17 05:52:13,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:13,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:52:13,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:13,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:52:13,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:52:13,922 INFO L87 Difference]: Start difference. First operand 296 states and 409 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:14,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:14,039 INFO L93 Difference]: Finished difference Result 597 states and 821 transitions. [2025-03-17 05:52:14,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:52:14,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2025-03-17 05:52:14,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:14,041 INFO L225 Difference]: With dead ends: 597 [2025-03-17 05:52:14,041 INFO L226 Difference]: Without dead ends: 302 [2025-03-17 05:52:14,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:52:14,042 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 59 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:14,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 820 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:52:14,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-17 05:52:14,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 290. [2025-03-17 05:52:14,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 249 states have (on average 1.3293172690763053) internal successors, (331), 252 states have internal predecessors, (331), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:52:14,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 399 transitions. [2025-03-17 05:52:14,068 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 399 transitions. Word has length 153 [2025-03-17 05:52:14,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:14,068 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 399 transitions. [2025-03-17 05:52:14,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:14,068 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 399 transitions. [2025-03-17 05:52:14,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 05:52:14,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:14,069 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:14,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:52:14,069 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:14,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:14,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1971222301, now seen corresponding path program 1 times [2025-03-17 05:52:14,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:14,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858078550] [2025-03-17 05:52:14,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:14,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:14,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 05:52:14,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 05:52:14,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:14,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:14,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:14,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858078550] [2025-03-17 05:52:14,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858078550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:14,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:14,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:52:14,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693747197] [2025-03-17 05:52:14,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:14,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:52:14,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:14,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:52:14,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:52:14,281 INFO L87 Difference]: Start difference. First operand 290 states and 399 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:14,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:14,398 INFO L93 Difference]: Finished difference Result 667 states and 914 transitions. [2025-03-17 05:52:14,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:52:14,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2025-03-17 05:52:14,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:14,400 INFO L225 Difference]: With dead ends: 667 [2025-03-17 05:52:14,400 INFO L226 Difference]: Without dead ends: 378 [2025-03-17 05:52:14,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:52:14,401 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 60 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:14,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 783 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:52:14,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-17 05:52:14,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 290. [2025-03-17 05:52:14,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 249 states have (on average 1.321285140562249) internal successors, (329), 252 states have internal predecessors, (329), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:52:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 397 transitions. [2025-03-17 05:52:14,426 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 397 transitions. Word has length 153 [2025-03-17 05:52:14,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:14,427 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 397 transitions. [2025-03-17 05:52:14,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:14,427 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 397 transitions. [2025-03-17 05:52:14,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 05:52:14,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:14,428 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:14,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:52:14,428 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:14,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:14,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1465663676, now seen corresponding path program 1 times [2025-03-17 05:52:14,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:14,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421658507] [2025-03-17 05:52:14,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:14,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:14,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 05:52:14,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 05:52:14,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:14,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:15,970 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:15,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:15,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421658507] [2025-03-17 05:52:15,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421658507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:15,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:15,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 05:52:15,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466836275] [2025-03-17 05:52:15,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:15,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:52:15,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:15,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:52:15,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:52:15,972 INFO L87 Difference]: Start difference. First operand 290 states and 397 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 05:52:17,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:17,346 INFO L93 Difference]: Finished difference Result 1183 states and 1608 transitions. [2025-03-17 05:52:17,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 05:52:17,347 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 153 [2025-03-17 05:52:17,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:17,352 INFO L225 Difference]: With dead ends: 1183 [2025-03-17 05:52:17,353 INFO L226 Difference]: Without dead ends: 894 [2025-03-17 05:52:17,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=252, Invalid=1080, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 05:52:17,355 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 796 mSDsluCounter, 1999 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 2200 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:17,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 2200 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:52:17,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-03-17 05:52:17,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 493. [2025-03-17 05:52:17,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 413 states have (on average 1.305084745762712) internal successors, (539), 418 states have internal predecessors, (539), 66 states have call successors, (66), 13 states have call predecessors, (66), 13 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:52:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 671 transitions. [2025-03-17 05:52:17,435 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 671 transitions. Word has length 153 [2025-03-17 05:52:17,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:17,436 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 671 transitions. [2025-03-17 05:52:17,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 05:52:17,437 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 671 transitions. [2025-03-17 05:52:17,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 05:52:17,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:17,439 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:17,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:52:17,439 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:17,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:17,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1816463613, now seen corresponding path program 1 times [2025-03-17 05:52:17,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:17,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002515890] [2025-03-17 05:52:17,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:17,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:17,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 05:52:17,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 05:52:17,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:17,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:18,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:18,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002515890] [2025-03-17 05:52:18,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002515890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:18,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:18,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:52:18,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270150020] [2025-03-17 05:52:18,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:18,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:52:18,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:18,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:52:18,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:52:18,201 INFO L87 Difference]: Start difference. First operand 493 states and 671 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:18,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:18,819 INFO L93 Difference]: Finished difference Result 1350 states and 1835 transitions. [2025-03-17 05:52:18,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 05:52:18,819 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2025-03-17 05:52:18,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:18,825 INFO L225 Difference]: With dead ends: 1350 [2025-03-17 05:52:18,826 INFO L226 Difference]: Without dead ends: 1061 [2025-03-17 05:52:18,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=707, Unknown=0, NotChecked=0, Total=870 [2025-03-17 05:52:18,827 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 380 mSDsluCounter, 1922 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 2202 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:18,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 2202 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:52:18,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2025-03-17 05:52:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 718. [2025-03-17 05:52:18,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 618 states have (on average 1.3220064724919094) internal successors, (817), 627 states have internal predecessors, (817), 82 states have call successors, (82), 17 states have call predecessors, (82), 17 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 05:52:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 981 transitions. [2025-03-17 05:52:18,894 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 981 transitions. Word has length 153 [2025-03-17 05:52:18,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:18,895 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 981 transitions. [2025-03-17 05:52:18,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 981 transitions. [2025-03-17 05:52:18,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:52:18,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:18,897 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:18,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:52:18,898 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:18,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:18,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1277155744, now seen corresponding path program 1 times [2025-03-17 05:52:18,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:18,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35796876] [2025-03-17 05:52:18,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:18,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:18,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:52:18,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:52:18,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:18,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:18,997 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:18,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:18,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35796876] [2025-03-17 05:52:18,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35796876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:18,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:18,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:52:18,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821367936] [2025-03-17 05:52:18,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:18,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:52:18,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:18,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:52:18,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:52:18,999 INFO L87 Difference]: Start difference. First operand 718 states and 981 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:19,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:19,111 INFO L93 Difference]: Finished difference Result 1384 states and 1898 transitions. [2025-03-17 05:52:19,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:52:19,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2025-03-17 05:52:19,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:19,117 INFO L225 Difference]: With dead ends: 1384 [2025-03-17 05:52:19,117 INFO L226 Difference]: Without dead ends: 1001 [2025-03-17 05:52:19,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:52:19,119 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 63 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:19,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 657 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:52:19,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2025-03-17 05:52:19,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 807. [2025-03-17 05:52:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 707 states have (on average 1.3224893917963225) internal successors, (935), 716 states have internal predecessors, (935), 82 states have call successors, (82), 17 states have call predecessors, (82), 17 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 05:52:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1099 transitions. [2025-03-17 05:52:19,179 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1099 transitions. Word has length 154 [2025-03-17 05:52:19,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:19,179 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1099 transitions. [2025-03-17 05:52:19,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:19,179 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1099 transitions. [2025-03-17 05:52:19,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:52:19,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:19,181 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:19,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:52:19,183 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:19,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:19,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1510259743, now seen corresponding path program 1 times [2025-03-17 05:52:19,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:19,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278794258] [2025-03-17 05:52:19,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:19,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:19,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:52:19,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:52:19,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:19,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:19,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:19,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278794258] [2025-03-17 05:52:19,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278794258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:19,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:19,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:52:19,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712711886] [2025-03-17 05:52:19,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:19,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:52:19,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:19,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:52:19,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:52:19,313 INFO L87 Difference]: Start difference. First operand 807 states and 1099 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:19,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:19,442 INFO L93 Difference]: Finished difference Result 1560 states and 2119 transitions. [2025-03-17 05:52:19,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:52:19,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2025-03-17 05:52:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:19,448 INFO L225 Difference]: With dead ends: 1560 [2025-03-17 05:52:19,448 INFO L226 Difference]: Without dead ends: 1098 [2025-03-17 05:52:19,449 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-17 05:52:19,449 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 76 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:19,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 539 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:52:19,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2025-03-17 05:52:19,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 856. [2025-03-17 05:52:19,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 756 states have (on average 1.3227513227513228) internal successors, (1000), 765 states have internal predecessors, (1000), 82 states have call successors, (82), 17 states have call predecessors, (82), 17 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 05:52:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1164 transitions. [2025-03-17 05:52:19,510 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1164 transitions. Word has length 154 [2025-03-17 05:52:19,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:19,510 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1164 transitions. [2025-03-17 05:52:19,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:19,511 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1164 transitions. [2025-03-17 05:52:19,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:52:19,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:19,513 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:19,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:52:19,513 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:19,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:19,514 INFO L85 PathProgramCache]: Analyzing trace with hash -77728473, now seen corresponding path program 1 times [2025-03-17 05:52:19,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:19,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819911004] [2025-03-17 05:52:19,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:19,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:19,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:52:19,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:52:19,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:19,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:20,651 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:20,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:20,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819911004] [2025-03-17 05:52:20,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819911004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:20,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:20,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:52:20,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033721998] [2025-03-17 05:52:20,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:20,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:52:20,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:20,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:52:20,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:52:20,654 INFO L87 Difference]: Start difference. First operand 856 states and 1164 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 05:52:21,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:21,515 INFO L93 Difference]: Finished difference Result 1605 states and 2154 transitions. [2025-03-17 05:52:21,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:52:21,515 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 154 [2025-03-17 05:52:21,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:21,520 INFO L225 Difference]: With dead ends: 1605 [2025-03-17 05:52:21,520 INFO L226 Difference]: Without dead ends: 1192 [2025-03-17 05:52:21,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2025-03-17 05:52:21,521 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 638 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:21,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 1476 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:52:21,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2025-03-17 05:52:21,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 803. [2025-03-17 05:52:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 702 states have (on average 1.3176638176638176) internal successors, (925), 711 states have internal predecessors, (925), 82 states have call successors, (82), 18 states have call predecessors, (82), 18 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 05:52:21,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1089 transitions. [2025-03-17 05:52:21,607 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1089 transitions. Word has length 154 [2025-03-17 05:52:21,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:21,608 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1089 transitions. [2025-03-17 05:52:21,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 05:52:21,608 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1089 transitions. [2025-03-17 05:52:21,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:52:21,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:21,610 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:21,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:52:21,610 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:21,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:21,611 INFO L85 PathProgramCache]: Analyzing trace with hash -732948097, now seen corresponding path program 1 times [2025-03-17 05:52:21,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:21,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656950955] [2025-03-17 05:52:21,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:21,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:21,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:52:21,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:52:21,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:21,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:21,733 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:21,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:21,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656950955] [2025-03-17 05:52:21,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656950955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:21,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:21,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:52:21,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984615613] [2025-03-17 05:52:21,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:21,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:52:21,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:21,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:52:21,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:52:21,735 INFO L87 Difference]: Start difference. First operand 803 states and 1089 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:21,872 INFO L93 Difference]: Finished difference Result 1576 states and 2129 transitions. [2025-03-17 05:52:21,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:52:21,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2025-03-17 05:52:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:21,877 INFO L225 Difference]: With dead ends: 1576 [2025-03-17 05:52:21,877 INFO L226 Difference]: Without dead ends: 901 [2025-03-17 05:52:21,878 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-17 05:52:21,879 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 76 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:21,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 686 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:52:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2025-03-17 05:52:21,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 541. [2025-03-17 05:52:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 464 states have (on average 1.290948275862069) internal successors, (599), 467 states have internal predecessors, (599), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 05:52:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 723 transitions. [2025-03-17 05:52:21,939 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 723 transitions. Word has length 154 [2025-03-17 05:52:21,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:21,939 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 723 transitions. [2025-03-17 05:52:21,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:21,940 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 723 transitions. [2025-03-17 05:52:21,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:52:21,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:21,942 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:21,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:52:21,942 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:21,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:21,943 INFO L85 PathProgramCache]: Analyzing trace with hash 774603712, now seen corresponding path program 1 times [2025-03-17 05:52:21,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:21,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306295179] [2025-03-17 05:52:21,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:21,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:21,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:52:21,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:52:21,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:21,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:22,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:22,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306295179] [2025-03-17 05:52:22,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306295179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:22,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:22,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:52:22,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49032961] [2025-03-17 05:52:22,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:22,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:52:22,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:22,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:52:22,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:52:22,035 INFO L87 Difference]: Start difference. First operand 541 states and 723 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:22,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:22,138 INFO L93 Difference]: Finished difference Result 1133 states and 1522 transitions. [2025-03-17 05:52:22,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:52:22,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2025-03-17 05:52:22,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:22,142 INFO L225 Difference]: With dead ends: 1133 [2025-03-17 05:52:22,142 INFO L226 Difference]: Without dead ends: 706 [2025-03-17 05:52:22,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:52:22,145 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 54 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:22,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 935 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:52:22,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-03-17 05:52:22,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 602. [2025-03-17 05:52:22,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 525 states have (on average 1.2952380952380953) internal successors, (680), 528 states have internal predecessors, (680), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 05:52:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 804 transitions. [2025-03-17 05:52:22,198 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 804 transitions. Word has length 154 [2025-03-17 05:52:22,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:22,198 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 804 transitions. [2025-03-17 05:52:22,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 804 transitions. [2025-03-17 05:52:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:52:22,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:22,200 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:22,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:52:22,200 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:22,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:22,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2087832314, now seen corresponding path program 1 times [2025-03-17 05:52:22,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:22,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398136508] [2025-03-17 05:52:22,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:22,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:22,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:52:22,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:52:22,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:22,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:52:23,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:23,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398136508] [2025-03-17 05:52:23,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398136508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:52:23,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906344051] [2025-03-17 05:52:23,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:23,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:52:23,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:52:23,604 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:52:23,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:52:23,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:52:23,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:52:23,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:23,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:23,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 05:52:23,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:52:23,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:52:23,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:52:24,021 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 57 treesize of output 45 [2025-03-17 05:52:24,067 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 49 treesize of output 29 [2025-03-17 05:52:24,131 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-17 05:52:24,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:52:24,270 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:24,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906344051] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:52:24,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:52:24,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [21, 9] total 27 [2025-03-17 05:52:24,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823593398] [2025-03-17 05:52:24,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:24,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:52:24,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:24,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:52:24,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2025-03-17 05:52:24,272 INFO L87 Difference]: Start difference. First operand 602 states and 804 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:24,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:24,588 INFO L93 Difference]: Finished difference Result 1358 states and 1793 transitions. [2025-03-17 05:52:24,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:52:24,589 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2025-03-17 05:52:24,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:24,593 INFO L225 Difference]: With dead ends: 1358 [2025-03-17 05:52:24,593 INFO L226 Difference]: Without dead ends: 870 [2025-03-17 05:52:24,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2025-03-17 05:52:24,595 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 72 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:24,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1327 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:52:24,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-03-17 05:52:24,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 590. [2025-03-17 05:52:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 513 states have (on average 1.290448343079922) internal successors, (662), 516 states have internal predecessors, (662), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 05:52:24,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 786 transitions. [2025-03-17 05:52:24,648 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 786 transitions. Word has length 154 [2025-03-17 05:52:24,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:24,648 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 786 transitions. [2025-03-17 05:52:24,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:24,649 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 786 transitions. [2025-03-17 05:52:24,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 05:52:24,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:24,651 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:24,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 05:52:24,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:52:24,852 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:24,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:24,852 INFO L85 PathProgramCache]: Analyzing trace with hash 676639381, now seen corresponding path program 1 times [2025-03-17 05:52:24,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:24,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140770409] [2025-03-17 05:52:24,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:24,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:24,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 05:52:24,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 05:52:24,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:24,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:25,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:25,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140770409] [2025-03-17 05:52:25,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140770409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:25,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:25,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-17 05:52:25,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73383325] [2025-03-17 05:52:25,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:25,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 05:52:25,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:25,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 05:52:25,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:52:25,826 INFO L87 Difference]: Start difference. First operand 590 states and 786 transitions. Second operand has 18 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-17 05:52:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:27,602 INFO L93 Difference]: Finished difference Result 2235 states and 2969 transitions. [2025-03-17 05:52:27,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:52:27,602 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 155 [2025-03-17 05:52:27,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:27,608 INFO L225 Difference]: With dead ends: 2235 [2025-03-17 05:52:27,608 INFO L226 Difference]: Without dead ends: 1743 [2025-03-17 05:52:27,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2025-03-17 05:52:27,609 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1737 mSDsluCounter, 2051 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1737 SdHoareTripleChecker+Valid, 2280 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:27,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1737 Valid, 2280 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 05:52:27,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2025-03-17 05:52:27,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1165. [2025-03-17 05:52:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 1035 states have (on average 1.298550724637681) internal successors, (1344), 1041 states have internal predecessors, (1344), 104 states have call successors, (104), 25 states have call predecessors, (104), 25 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-17 05:52:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1552 transitions. [2025-03-17 05:52:27,762 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1552 transitions. Word has length 155 [2025-03-17 05:52:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:27,762 INFO L471 AbstractCegarLoop]: Abstraction has 1165 states and 1552 transitions. [2025-03-17 05:52:27,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-17 05:52:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1552 transitions. [2025-03-17 05:52:27,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 05:52:27,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:27,765 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:27,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:52:27,765 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:27,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:27,765 INFO L85 PathProgramCache]: Analyzing trace with hash -633810984, now seen corresponding path program 1 times [2025-03-17 05:52:27,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:27,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468350352] [2025-03-17 05:52:27,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:27,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:27,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 05:52:27,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 05:52:27,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:27,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:27,920 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:27,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:27,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468350352] [2025-03-17 05:52:27,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468350352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:27,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:27,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:52:27,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140459860] [2025-03-17 05:52:27,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:27,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:52:27,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:27,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:52:27,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:52:27,922 INFO L87 Difference]: Start difference. First operand 1165 states and 1552 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:28,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:28,094 INFO L93 Difference]: Finished difference Result 3125 states and 4116 transitions. [2025-03-17 05:52:28,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:52:28,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-03-17 05:52:28,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:28,101 INFO L225 Difference]: With dead ends: 3125 [2025-03-17 05:52:28,101 INFO L226 Difference]: Without dead ends: 2079 [2025-03-17 05:52:28,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:52:28,103 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 87 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:28,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 643 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:52:28,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2025-03-17 05:52:28,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 2075. [2025-03-17 05:52:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2075 states, 1857 states have (on average 1.2751750134625741) internal successors, (2368), 1871 states have internal predecessors, (2368), 172 states have call successors, (172), 45 states have call predecessors, (172), 45 states have return successors, (172), 158 states have call predecessors, (172), 172 states have call successors, (172) [2025-03-17 05:52:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 2712 transitions. [2025-03-17 05:52:28,271 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 2712 transitions. Word has length 156 [2025-03-17 05:52:28,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:28,271 INFO L471 AbstractCegarLoop]: Abstraction has 2075 states and 2712 transitions. [2025-03-17 05:52:28,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 2712 transitions. [2025-03-17 05:52:28,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 05:52:28,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:28,274 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:28,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:52:28,274 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:28,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:28,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1163140375, now seen corresponding path program 1 times [2025-03-17 05:52:28,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:28,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094853813] [2025-03-17 05:52:28,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:28,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:28,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 05:52:28,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 05:52:28,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:28,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:28,712 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:28,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:28,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094853813] [2025-03-17 05:52:28,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094853813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:28,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:28,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:52:28,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611792285] [2025-03-17 05:52:28,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:28,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:52:28,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:28,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:52:28,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:52:28,714 INFO L87 Difference]: Start difference. First operand 2075 states and 2712 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:29,326 INFO L93 Difference]: Finished difference Result 6046 states and 7852 transitions. [2025-03-17 05:52:29,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:52:29,326 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-03-17 05:52:29,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:29,337 INFO L225 Difference]: With dead ends: 6046 [2025-03-17 05:52:29,337 INFO L226 Difference]: Without dead ends: 4126 [2025-03-17 05:52:29,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:52:29,340 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 193 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:29,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1696 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:52:29,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4126 states. [2025-03-17 05:52:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4126 to 3398. [2025-03-17 05:52:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3398 states, 3088 states have (on average 1.2645725388601037) internal successors, (3905), 3110 states have internal predecessors, (3905), 244 states have call successors, (244), 65 states have call predecessors, (244), 65 states have return successors, (244), 222 states have call predecessors, (244), 244 states have call successors, (244) [2025-03-17 05:52:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 4393 transitions. [2025-03-17 05:52:29,577 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 4393 transitions. Word has length 156 [2025-03-17 05:52:29,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:29,577 INFO L471 AbstractCegarLoop]: Abstraction has 3398 states and 4393 transitions. [2025-03-17 05:52:29,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:29,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 4393 transitions. [2025-03-17 05:52:29,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 05:52:29,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:29,580 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:29,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:52:29,580 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:29,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:29,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1999420909, now seen corresponding path program 1 times [2025-03-17 05:52:29,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:29,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500951001] [2025-03-17 05:52:29,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:29,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:29,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 05:52:29,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 05:52:29,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:29,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:29,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:29,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500951001] [2025-03-17 05:52:29,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500951001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:29,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:29,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:52:29,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394293381] [2025-03-17 05:52:29,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:29,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:52:29,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:29,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:52:29,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:52:29,686 INFO L87 Difference]: Start difference. First operand 3398 states and 4393 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:29,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:29,925 INFO L93 Difference]: Finished difference Result 6560 states and 8469 transitions. [2025-03-17 05:52:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:52:29,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-03-17 05:52:29,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:29,935 INFO L225 Difference]: With dead ends: 6560 [2025-03-17 05:52:29,935 INFO L226 Difference]: Without dead ends: 3368 [2025-03-17 05:52:29,939 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-17 05:52:29,940 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 46 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:29,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 562 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:52:29,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3368 states. [2025-03-17 05:52:30,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3368 to 3366. [2025-03-17 05:52:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3366 states, 3056 states have (on average 1.2516361256544504) internal successors, (3825), 3078 states have internal predecessors, (3825), 244 states have call successors, (244), 65 states have call predecessors, (244), 65 states have return successors, (244), 222 states have call predecessors, (244), 244 states have call successors, (244) [2025-03-17 05:52:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3366 states to 3366 states and 4313 transitions. [2025-03-17 05:52:30,251 INFO L78 Accepts]: Start accepts. Automaton has 3366 states and 4313 transitions. Word has length 156 [2025-03-17 05:52:30,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:30,251 INFO L471 AbstractCegarLoop]: Abstraction has 3366 states and 4313 transitions. [2025-03-17 05:52:30,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:30,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3366 states and 4313 transitions. [2025-03-17 05:52:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 05:52:30,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:30,256 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:30,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:52:30,256 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:30,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:30,257 INFO L85 PathProgramCache]: Analyzing trace with hash 327803033, now seen corresponding path program 1 times [2025-03-17 05:52:30,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:30,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132871904] [2025-03-17 05:52:30,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:30,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:30,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 05:52:30,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 05:52:30,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:30,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:30,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:30,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132871904] [2025-03-17 05:52:30,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132871904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:30,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:30,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:52:30,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119844763] [2025-03-17 05:52:30,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:30,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:52:30,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:30,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:52:30,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:52:30,434 INFO L87 Difference]: Start difference. First operand 3366 states and 4313 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:30,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:30,696 INFO L93 Difference]: Finished difference Result 6510 states and 8393 transitions. [2025-03-17 05:52:30,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:52:30,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-03-17 05:52:30,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:30,707 INFO L225 Difference]: With dead ends: 6510 [2025-03-17 05:52:30,708 INFO L226 Difference]: Without dead ends: 3335 [2025-03-17 05:52:30,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:52:30,712 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 139 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:30,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 980 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:52:30,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2025-03-17 05:52:30,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 3159. [2025-03-17 05:52:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3159 states, 2829 states have (on average 1.2488511841640155) internal successors, (3533), 2851 states have internal predecessors, (3533), 260 states have call successors, (260), 69 states have call predecessors, (260), 69 states have return successors, (260), 238 states have call predecessors, (260), 260 states have call successors, (260) [2025-03-17 05:52:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3159 states to 3159 states and 4053 transitions. [2025-03-17 05:52:30,980 INFO L78 Accepts]: Start accepts. Automaton has 3159 states and 4053 transitions. Word has length 156 [2025-03-17 05:52:30,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:30,981 INFO L471 AbstractCegarLoop]: Abstraction has 3159 states and 4053 transitions. [2025-03-17 05:52:30,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3159 states and 4053 transitions. [2025-03-17 05:52:30,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 05:52:30,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:30,983 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:30,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:52:30,984 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:30,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:30,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1977189164, now seen corresponding path program 1 times [2025-03-17 05:52:30,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:30,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984653522] [2025-03-17 05:52:30,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:30,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:30,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 05:52:31,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 05:52:31,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:31,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:31,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:31,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984653522] [2025-03-17 05:52:31,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984653522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:31,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:31,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:52:31,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367773361] [2025-03-17 05:52:31,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:31,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:52:31,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:31,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:52:31,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:52:31,090 INFO L87 Difference]: Start difference. First operand 3159 states and 4053 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:31,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:31,338 INFO L93 Difference]: Finished difference Result 6113 states and 7831 transitions. [2025-03-17 05:52:31,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:52:31,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-03-17 05:52:31,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:31,347 INFO L225 Difference]: With dead ends: 6113 [2025-03-17 05:52:31,347 INFO L226 Difference]: Without dead ends: 3145 [2025-03-17 05:52:31,351 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-17 05:52:31,352 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 46 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:31,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 667 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:52:31,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3145 states. [2025-03-17 05:52:31,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3145 to 3143. [2025-03-17 05:52:31,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3143 states, 2813 states have (on average 1.2445787415570566) internal successors, (3501), 2835 states have internal predecessors, (3501), 260 states have call successors, (260), 69 states have call predecessors, (260), 69 states have return successors, (260), 238 states have call predecessors, (260), 260 states have call successors, (260) [2025-03-17 05:52:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 4021 transitions. [2025-03-17 05:52:31,723 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 4021 transitions. Word has length 156 [2025-03-17 05:52:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:31,723 INFO L471 AbstractCegarLoop]: Abstraction has 3143 states and 4021 transitions. [2025-03-17 05:52:31,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 4021 transitions. [2025-03-17 05:52:31,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 05:52:31,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:31,726 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:31,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 05:52:31,726 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:31,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:31,727 INFO L85 PathProgramCache]: Analyzing trace with hash 952168207, now seen corresponding path program 1 times [2025-03-17 05:52:31,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:31,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370239914] [2025-03-17 05:52:31,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:31,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:31,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 05:52:31,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 05:52:31,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:31,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:32,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:32,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370239914] [2025-03-17 05:52:32,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370239914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:32,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:32,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:52:32,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293985809] [2025-03-17 05:52:32,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:32,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:52:32,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:32,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:52:32,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:52:32,221 INFO L87 Difference]: Start difference. First operand 3143 states and 4021 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:32,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:32,746 INFO L93 Difference]: Finished difference Result 6680 states and 8522 transitions. [2025-03-17 05:52:32,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:52:32,746 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-03-17 05:52:32,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:32,756 INFO L225 Difference]: With dead ends: 6680 [2025-03-17 05:52:32,756 INFO L226 Difference]: Without dead ends: 3728 [2025-03-17 05:52:32,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:52:32,760 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 240 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:32,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1355 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:52:32,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3728 states. [2025-03-17 05:52:32,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3728 to 2992. [2025-03-17 05:52:32,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2992 states, 2765 states have (on average 1.247377938517179) internal successors, (3449), 2779 states have internal predecessors, (3449), 176 states have call successors, (176), 50 states have call predecessors, (176), 50 states have return successors, (176), 162 states have call predecessors, (176), 176 states have call successors, (176) [2025-03-17 05:52:32,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2992 states to 2992 states and 3801 transitions. [2025-03-17 05:52:32,962 INFO L78 Accepts]: Start accepts. Automaton has 2992 states and 3801 transitions. Word has length 156 [2025-03-17 05:52:32,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:32,962 INFO L471 AbstractCegarLoop]: Abstraction has 2992 states and 3801 transitions. [2025-03-17 05:52:32,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:32,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2992 states and 3801 transitions. [2025-03-17 05:52:32,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 05:52:32,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:32,965 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:32,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 05:52:32,965 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:32,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:32,966 INFO L85 PathProgramCache]: Analyzing trace with hash -844783152, now seen corresponding path program 1 times [2025-03-17 05:52:32,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:32,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839713668] [2025-03-17 05:52:32,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:32,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:32,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 05:52:32,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 05:52:32,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:32,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:33,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:33,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839713668] [2025-03-17 05:52:33,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839713668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:33,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:33,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:52:33,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312033939] [2025-03-17 05:52:33,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:33,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:52:33,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:33,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:52:33,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:52:33,118 INFO L87 Difference]: Start difference. First operand 2992 states and 3801 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:33,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:33,484 INFO L93 Difference]: Finished difference Result 6919 states and 8767 transitions. [2025-03-17 05:52:33,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:52:33,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-03-17 05:52:33,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:33,493 INFO L225 Difference]: With dead ends: 6919 [2025-03-17 05:52:33,493 INFO L226 Difference]: Without dead ends: 4131 [2025-03-17 05:52:33,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:52:33,497 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 157 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:33,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 525 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:52:33,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4131 states. [2025-03-17 05:52:33,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4131 to 4127. [2025-03-17 05:52:33,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4127 states, 3801 states have (on average 1.238358326756117) internal successors, (4707), 3823 states have internal predecessors, (4707), 252 states have call successors, (252), 73 states have call predecessors, (252), 73 states have return successors, (252), 230 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-17 05:52:33,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4127 states to 4127 states and 5211 transitions. [2025-03-17 05:52:33,768 INFO L78 Accepts]: Start accepts. Automaton has 4127 states and 5211 transitions. Word has length 156 [2025-03-17 05:52:33,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:33,768 INFO L471 AbstractCegarLoop]: Abstraction has 4127 states and 5211 transitions. [2025-03-17 05:52:33,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:33,768 INFO L276 IsEmpty]: Start isEmpty. Operand 4127 states and 5211 transitions. [2025-03-17 05:52:33,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 05:52:33,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:33,771 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:33,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 05:52:33,771 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:33,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:33,771 INFO L85 PathProgramCache]: Analyzing trace with hash 116830865, now seen corresponding path program 1 times [2025-03-17 05:52:33,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:33,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77273034] [2025-03-17 05:52:33,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:33,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:33,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 05:52:33,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 05:52:33,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:33,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:33,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:33,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77273034] [2025-03-17 05:52:33,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77273034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:33,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:33,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:52:33,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080102484] [2025-03-17 05:52:33,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:33,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:52:33,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:33,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:52:33,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:52:33,893 INFO L87 Difference]: Start difference. First operand 4127 states and 5211 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:34,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:34,253 INFO L93 Difference]: Finished difference Result 8331 states and 10579 transitions. [2025-03-17 05:52:34,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:52:34,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-03-17 05:52:34,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:34,275 INFO L225 Difference]: With dead ends: 8331 [2025-03-17 05:52:34,275 INFO L226 Difference]: Without dead ends: 4442 [2025-03-17 05:52:34,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:52:34,278 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 139 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:34,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 976 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:52:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4442 states. [2025-03-17 05:52:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4442 to 3872. [2025-03-17 05:52:34,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3872 states, 3546 states have (on average 1.2371686407219402) internal successors, (4387), 3568 states have internal predecessors, (4387), 252 states have call successors, (252), 73 states have call predecessors, (252), 73 states have return successors, (252), 230 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-17 05:52:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3872 states to 3872 states and 4891 transitions. [2025-03-17 05:52:34,623 INFO L78 Accepts]: Start accepts. Automaton has 3872 states and 4891 transitions. Word has length 156 [2025-03-17 05:52:34,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:34,623 INFO L471 AbstractCegarLoop]: Abstraction has 3872 states and 4891 transitions. [2025-03-17 05:52:34,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:34,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3872 states and 4891 transitions. [2025-03-17 05:52:34,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 05:52:34,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:34,626 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:34,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 05:52:34,626 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:34,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:34,626 INFO L85 PathProgramCache]: Analyzing trace with hash -2020977310, now seen corresponding path program 1 times [2025-03-17 05:52:34,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:34,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177324033] [2025-03-17 05:52:34,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:34,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:34,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 05:52:34,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 05:52:34,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:34,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:35,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:35,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177324033] [2025-03-17 05:52:35,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177324033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:35,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:35,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:52:35,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448416304] [2025-03-17 05:52:35,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:35,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:52:35,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:35,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:52:35,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:52:35,155 INFO L87 Difference]: Start difference. First operand 3872 states and 4891 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 05:52:35,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:35,735 INFO L93 Difference]: Finished difference Result 7698 states and 9716 transitions. [2025-03-17 05:52:35,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:52:35,735 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), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 156 [2025-03-17 05:52:35,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:35,744 INFO L225 Difference]: With dead ends: 7698 [2025-03-17 05:52:35,744 INFO L226 Difference]: Without dead ends: 4064 [2025-03-17 05:52:35,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:52:35,750 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 199 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:35,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 804 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:52:35,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4064 states. [2025-03-17 05:52:35,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4064 to 1912. [2025-03-17 05:52:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1912 states, 1735 states have (on average 1.2288184438040346) internal successors, (2132), 1746 states have internal predecessors, (2132), 136 states have call successors, (136), 40 states have call predecessors, (136), 40 states have return successors, (136), 125 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-17 05:52:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2404 transitions. [2025-03-17 05:52:35,980 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2404 transitions. Word has length 156 [2025-03-17 05:52:35,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:35,980 INFO L471 AbstractCegarLoop]: Abstraction has 1912 states and 2404 transitions. [2025-03-17 05:52:35,980 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), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 05:52:35,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2404 transitions. [2025-03-17 05:52:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 05:52:35,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:35,983 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:35,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 05:52:35,983 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:35,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:35,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1123549035, now seen corresponding path program 1 times [2025-03-17 05:52:35,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:35,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803578559] [2025-03-17 05:52:35,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:35,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:36,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 05:52:36,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 05:52:36,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:36,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:36,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:36,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803578559] [2025-03-17 05:52:36,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803578559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:36,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:36,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:52:36,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347408495] [2025-03-17 05:52:36,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:36,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:52:36,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:36,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:52:36,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:52:36,088 INFO L87 Difference]: Start difference. First operand 1912 states and 2404 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:36,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:36,334 INFO L93 Difference]: Finished difference Result 4857 states and 6110 transitions. [2025-03-17 05:52:36,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:52:36,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2025-03-17 05:52:36,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:36,341 INFO L225 Difference]: With dead ends: 4857 [2025-03-17 05:52:36,341 INFO L226 Difference]: Without dead ends: 3129 [2025-03-17 05:52:36,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:52:36,345 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 108 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:36,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 427 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:52:36,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3129 states. [2025-03-17 05:52:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3129 to 2372. [2025-03-17 05:52:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2372 states, 2195 states have (on average 1.2441913439635535) internal successors, (2731), 2206 states have internal predecessors, (2731), 136 states have call successors, (136), 40 states have call predecessors, (136), 40 states have return successors, (136), 125 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-17 05:52:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 3003 transitions. [2025-03-17 05:52:36,552 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 3003 transitions. Word has length 157 [2025-03-17 05:52:36,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:36,553 INFO L471 AbstractCegarLoop]: Abstraction has 2372 states and 3003 transitions. [2025-03-17 05:52:36,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:36,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 3003 transitions. [2025-03-17 05:52:36,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 05:52:36,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:36,555 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:36,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 05:52:36,555 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:36,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:36,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1629107660, now seen corresponding path program 1 times [2025-03-17 05:52:36,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:36,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041816177] [2025-03-17 05:52:36,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:36,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:36,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 05:52:36,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 05:52:36,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:36,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:36,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:36,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041816177] [2025-03-17 05:52:36,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041816177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:36,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:36,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:52:36,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875600173] [2025-03-17 05:52:36,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:36,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:52:36,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:36,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:52:36,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:52:36,689 INFO L87 Difference]: Start difference. First operand 2372 states and 3003 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:36,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:36,925 INFO L93 Difference]: Finished difference Result 5370 states and 6793 transitions. [2025-03-17 05:52:36,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:52:36,926 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2025-03-17 05:52:36,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:36,933 INFO L225 Difference]: With dead ends: 5370 [2025-03-17 05:52:36,933 INFO L226 Difference]: Without dead ends: 3618 [2025-03-17 05:52:36,936 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-17 05:52:36,937 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 80 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:36,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 693 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:52:36,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3618 states. [2025-03-17 05:52:37,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3618 to 2802. [2025-03-17 05:52:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2802 states, 2625 states have (on average 1.2468571428571429) internal successors, (3273), 2636 states have internal predecessors, (3273), 136 states have call successors, (136), 40 states have call predecessors, (136), 40 states have return successors, (136), 125 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-17 05:52:37,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 3545 transitions. [2025-03-17 05:52:37,129 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 3545 transitions. Word has length 157 [2025-03-17 05:52:37,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:37,130 INFO L471 AbstractCegarLoop]: Abstraction has 2802 states and 3545 transitions. [2025-03-17 05:52:37,130 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:37,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 3545 transitions. [2025-03-17 05:52:37,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 05:52:37,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:37,135 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:37,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 05:52:37,135 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:37,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:37,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1635706215, now seen corresponding path program 1 times [2025-03-17 05:52:37,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:37,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894206704] [2025-03-17 05:52:37,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:37,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:37,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 05:52:37,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 05:52:37,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:37,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:37,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:37,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894206704] [2025-03-17 05:52:37,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894206704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:37,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:37,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:52:37,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216604803] [2025-03-17 05:52:37,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:37,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:52:37,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:37,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:52:37,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:52:37,444 INFO L87 Difference]: Start difference. First operand 2802 states and 3545 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:38,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:38,023 INFO L93 Difference]: Finished difference Result 5570 states and 7057 transitions. [2025-03-17 05:52:38,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:52:38,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2025-03-17 05:52:38,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:38,033 INFO L225 Difference]: With dead ends: 5570 [2025-03-17 05:52:38,034 INFO L226 Difference]: Without dead ends: 3292 [2025-03-17 05:52:38,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-17 05:52:38,038 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 277 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:38,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 797 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:52:38,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2025-03-17 05:52:38,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 2802. [2025-03-17 05:52:38,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2802 states, 2625 states have (on average 1.1950476190476191) internal successors, (3137), 2636 states have internal predecessors, (3137), 136 states have call successors, (136), 40 states have call predecessors, (136), 40 states have return successors, (136), 125 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-17 05:52:38,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 3409 transitions. [2025-03-17 05:52:38,265 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 3409 transitions. Word has length 158 [2025-03-17 05:52:38,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:38,265 INFO L471 AbstractCegarLoop]: Abstraction has 2802 states and 3409 transitions. [2025-03-17 05:52:38,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:38,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 3409 transitions. [2025-03-17 05:52:38,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 05:52:38,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:38,268 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:38,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 05:52:38,268 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:38,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:38,268 INFO L85 PathProgramCache]: Analyzing trace with hash -167475499, now seen corresponding path program 1 times [2025-03-17 05:52:38,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:38,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294335367] [2025-03-17 05:52:38,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:38,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:38,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 05:52:38,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 05:52:38,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:38,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:38,873 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:38,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:38,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294335367] [2025-03-17 05:52:38,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294335367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:38,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:38,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:52:38,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735503030] [2025-03-17 05:52:38,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:38,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:52:38,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:38,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:52:38,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:52:38,874 INFO L87 Difference]: Start difference. First operand 2802 states and 3409 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:39,520 INFO L93 Difference]: Finished difference Result 7622 states and 9215 transitions. [2025-03-17 05:52:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:52:39,521 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2025-03-17 05:52:39,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:39,531 INFO L225 Difference]: With dead ends: 7622 [2025-03-17 05:52:39,531 INFO L226 Difference]: Without dead ends: 5464 [2025-03-17 05:52:39,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2025-03-17 05:52:39,536 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 605 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:39,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 1214 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:52:39,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5464 states. [2025-03-17 05:52:39,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5464 to 3453. [2025-03-17 05:52:39,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3453 states, 3169 states have (on average 1.183654149573998) internal successors, (3751), 3185 states have internal predecessors, (3751), 216 states have call successors, (216), 67 states have call predecessors, (216), 67 states have return successors, (216), 200 states have call predecessors, (216), 216 states have call successors, (216) [2025-03-17 05:52:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3453 states to 3453 states and 4183 transitions. [2025-03-17 05:52:39,838 INFO L78 Accepts]: Start accepts. Automaton has 3453 states and 4183 transitions. Word has length 158 [2025-03-17 05:52:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:39,838 INFO L471 AbstractCegarLoop]: Abstraction has 3453 states and 4183 transitions. [2025-03-17 05:52:39,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3453 states and 4183 transitions. [2025-03-17 05:52:39,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 05:52:39,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:39,841 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:39,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 05:52:39,841 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:39,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:39,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1575334836, now seen corresponding path program 1 times [2025-03-17 05:52:39,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:39,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135116061] [2025-03-17 05:52:39,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:39,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:39,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 05:52:39,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 05:52:39,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:39,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:39,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:39,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135116061] [2025-03-17 05:52:39,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135116061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:39,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:39,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:52:39,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143344897] [2025-03-17 05:52:39,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:39,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:52:39,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:39,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:52:39,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:52:39,972 INFO L87 Difference]: Start difference. First operand 3453 states and 4183 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:40,382 INFO L93 Difference]: Finished difference Result 8398 states and 10075 transitions. [2025-03-17 05:52:40,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:52:40,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2025-03-17 05:52:40,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:40,395 INFO L225 Difference]: With dead ends: 8398 [2025-03-17 05:52:40,395 INFO L226 Difference]: Without dead ends: 5589 [2025-03-17 05:52:40,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:52:40,399 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 50 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:40,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 658 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:52:40,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5589 states. [2025-03-17 05:52:40,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5589 to 5347. [2025-03-17 05:52:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5347 states, 5063 states have (on average 1.1722299032194352) internal successors, (5935), 5079 states have internal predecessors, (5935), 216 states have call successors, (216), 67 states have call predecessors, (216), 67 states have return successors, (216), 200 states have call predecessors, (216), 216 states have call successors, (216) [2025-03-17 05:52:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5347 states to 5347 states and 6367 transitions. [2025-03-17 05:52:40,716 INFO L78 Accepts]: Start accepts. Automaton has 5347 states and 6367 transitions. Word has length 158 [2025-03-17 05:52:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:40,716 INFO L471 AbstractCegarLoop]: Abstraction has 5347 states and 6367 transitions. [2025-03-17 05:52:40,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 5347 states and 6367 transitions. [2025-03-17 05:52:40,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 05:52:40,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:40,720 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:40,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 05:52:40,721 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:40,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:40,721 INFO L85 PathProgramCache]: Analyzing trace with hash -136455692, now seen corresponding path program 1 times [2025-03-17 05:52:40,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:40,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007714877] [2025-03-17 05:52:40,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:40,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:40,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 05:52:40,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 05:52:40,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:40,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:40,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:40,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007714877] [2025-03-17 05:52:40,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007714877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:40,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:40,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:52:40,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317340384] [2025-03-17 05:52:40,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:40,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:52:40,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:40,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:52:40,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:52:40,872 INFO L87 Difference]: Start difference. First operand 5347 states and 6367 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:41,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:41,397 INFO L93 Difference]: Finished difference Result 9187 states and 10935 transitions. [2025-03-17 05:52:41,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:52:41,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2025-03-17 05:52:41,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:41,410 INFO L225 Difference]: With dead ends: 9187 [2025-03-17 05:52:41,411 INFO L226 Difference]: Without dead ends: 5589 [2025-03-17 05:52:41,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:52:41,416 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 50 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:41,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 844 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:52:41,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5589 states. [2025-03-17 05:52:41,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5589 to 5347. [2025-03-17 05:52:41,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5347 states, 5063 states have (on average 1.1698597669365989) internal successors, (5923), 5079 states have internal predecessors, (5923), 216 states have call successors, (216), 67 states have call predecessors, (216), 67 states have return successors, (216), 200 states have call predecessors, (216), 216 states have call successors, (216) [2025-03-17 05:52:41,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5347 states to 5347 states and 6355 transitions. [2025-03-17 05:52:41,832 INFO L78 Accepts]: Start accepts. Automaton has 5347 states and 6355 transitions. Word has length 158 [2025-03-17 05:52:41,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:41,833 INFO L471 AbstractCegarLoop]: Abstraction has 5347 states and 6355 transitions. [2025-03-17 05:52:41,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:41,833 INFO L276 IsEmpty]: Start isEmpty. Operand 5347 states and 6355 transitions. [2025-03-17 05:52:41,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 05:52:41,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:41,837 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:41,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 05:52:41,838 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:41,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:41,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1606354643, now seen corresponding path program 1 times [2025-03-17 05:52:41,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:41,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373647708] [2025-03-17 05:52:41,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:41,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:41,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 05:52:41,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 05:52:41,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:41,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:52:42,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:42,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373647708] [2025-03-17 05:52:42,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373647708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:52:42,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536150927] [2025-03-17 05:52:42,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:42,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:52:42,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:52:42,286 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:52:42,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:52:42,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 05:52:42,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 05:52:42,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:42,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:42,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 05:52:42,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:52:43,072 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-03-17 05:52:43,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 84 [2025-03-17 05:52:43,109 INFO L349 Elim1Store]: treesize reduction 48, result has 15.8 percent of original size [2025-03-17 05:52:43,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 101 [2025-03-17 05:52:43,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 13 [2025-03-17 05:52:43,358 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 65 treesize of output 53 [2025-03-17 05:52:43,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 59 treesize of output 39 [2025-03-17 05:52:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:43,473 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:52:43,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536150927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:43,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:52:43,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [11] total 23 [2025-03-17 05:52:43,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106567094] [2025-03-17 05:52:43,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:43,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:52:43,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:43,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:52:43,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:52:43,476 INFO L87 Difference]: Start difference. First operand 5347 states and 6355 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:44,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:44,579 INFO L93 Difference]: Finished difference Result 10529 states and 12486 transitions. [2025-03-17 05:52:44,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:52:44,579 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2025-03-17 05:52:44,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:44,591 INFO L225 Difference]: With dead ends: 10529 [2025-03-17 05:52:44,591 INFO L226 Difference]: Without dead ends: 6931 [2025-03-17 05:52:44,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=943, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 05:52:44,599 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 223 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:44,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 2014 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:52:44,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6931 states. [2025-03-17 05:52:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6931 to 6904. [2025-03-17 05:52:45,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6904 states, 6473 states have (on average 1.1637571450641124) internal successors, (7533), 6501 states have internal predecessors, (7533), 330 states have call successors, (330), 100 states have call predecessors, (330), 100 states have return successors, (330), 302 states have call predecessors, (330), 330 states have call successors, (330) [2025-03-17 05:52:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 8193 transitions. [2025-03-17 05:52:45,167 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 8193 transitions. Word has length 158 [2025-03-17 05:52:45,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:45,167 INFO L471 AbstractCegarLoop]: Abstraction has 6904 states and 8193 transitions. [2025-03-17 05:52:45,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:45,167 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 8193 transitions. [2025-03-17 05:52:45,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 05:52:45,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:45,172 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:45,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 05:52:45,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:52:45,373 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:45,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:45,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1063186112, now seen corresponding path program 1 times [2025-03-17 05:52:45,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:45,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078446794] [2025-03-17 05:52:45,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:45,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:45,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 05:52:45,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 05:52:45,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:45,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:45,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:45,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078446794] [2025-03-17 05:52:45,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078446794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:45,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:45,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:52:45,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906460111] [2025-03-17 05:52:45,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:45,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:52:45,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:45,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:52:45,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:52:45,902 INFO L87 Difference]: Start difference. First operand 6904 states and 8193 transitions. Second operand has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 05:52:46,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:46,816 INFO L93 Difference]: Finished difference Result 11065 states and 13151 transitions. [2025-03-17 05:52:46,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:52:46,817 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 158 [2025-03-17 05:52:46,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:46,828 INFO L225 Difference]: With dead ends: 11065 [2025-03-17 05:52:46,828 INFO L226 Difference]: Without dead ends: 6915 [2025-03-17 05:52:46,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2025-03-17 05:52:46,833 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 592 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:46,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 989 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:52:46,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6915 states. [2025-03-17 05:52:47,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6915 to 6616. [2025-03-17 05:52:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6616 states, 6185 states have (on average 1.1597413096200484) internal successors, (7173), 6213 states have internal predecessors, (7173), 330 states have call successors, (330), 100 states have call predecessors, (330), 100 states have return successors, (330), 302 states have call predecessors, (330), 330 states have call successors, (330) [2025-03-17 05:52:47,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6616 states to 6616 states and 7833 transitions. [2025-03-17 05:52:47,331 INFO L78 Accepts]: Start accepts. Automaton has 6616 states and 7833 transitions. Word has length 158 [2025-03-17 05:52:47,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:47,331 INFO L471 AbstractCegarLoop]: Abstraction has 6616 states and 7833 transitions. [2025-03-17 05:52:47,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 05:52:47,331 INFO L276 IsEmpty]: Start isEmpty. Operand 6616 states and 7833 transitions. [2025-03-17 05:52:47,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 05:52:47,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:47,336 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:47,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 05:52:47,336 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:47,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:47,336 INFO L85 PathProgramCache]: Analyzing trace with hash 938352885, now seen corresponding path program 1 times [2025-03-17 05:52:47,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:47,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999970173] [2025-03-17 05:52:47,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:47,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:47,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 05:52:47,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 05:52:47,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:47,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:47,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:47,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999970173] [2025-03-17 05:52:47,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999970173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:47,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:47,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:52:47,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107242002] [2025-03-17 05:52:47,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:47,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:52:47,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:47,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:52:47,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:52:47,800 INFO L87 Difference]: Start difference. First operand 6616 states and 7833 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:48,476 INFO L93 Difference]: Finished difference Result 10288 states and 12185 transitions. [2025-03-17 05:52:48,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:52:48,476 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2025-03-17 05:52:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:48,485 INFO L225 Difference]: With dead ends: 10288 [2025-03-17 05:52:48,486 INFO L226 Difference]: Without dead ends: 6882 [2025-03-17 05:52:48,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:52:48,490 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 52 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:48,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1073 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:52:48,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6882 states. [2025-03-17 05:52:49,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6882 to 6652. [2025-03-17 05:52:49,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6652 states, 6221 states have (on average 1.1588169104645556) internal successors, (7209), 6249 states have internal predecessors, (7209), 330 states have call successors, (330), 100 states have call predecessors, (330), 100 states have return successors, (330), 302 states have call predecessors, (330), 330 states have call successors, (330) [2025-03-17 05:52:49,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6652 states to 6652 states and 7869 transitions. [2025-03-17 05:52:49,187 INFO L78 Accepts]: Start accepts. Automaton has 6652 states and 7869 transitions. Word has length 158 [2025-03-17 05:52:49,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:49,187 INFO L471 AbstractCegarLoop]: Abstraction has 6652 states and 7869 transitions. [2025-03-17 05:52:49,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:49,188 INFO L276 IsEmpty]: Start isEmpty. Operand 6652 states and 7869 transitions. [2025-03-17 05:52:49,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:52:49,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:49,191 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:49,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 05:52:49,192 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:49,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:49,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1669774491, now seen corresponding path program 1 times [2025-03-17 05:52:49,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:49,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648808670] [2025-03-17 05:52:49,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:49,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:49,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:52:49,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:52:49,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:49,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:49,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:49,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648808670] [2025-03-17 05:52:49,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648808670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:49,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:49,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:52:49,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857418746] [2025-03-17 05:52:49,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:49,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:52:49,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:49,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:52:49,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:52:49,723 INFO L87 Difference]: Start difference. First operand 6652 states and 7869 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:50,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:50,652 INFO L93 Difference]: Finished difference Result 11357 states and 13435 transitions. [2025-03-17 05:52:50,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:52:50,652 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-03-17 05:52:50,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:50,663 INFO L225 Difference]: With dead ends: 11357 [2025-03-17 05:52:50,663 INFO L226 Difference]: Without dead ends: 7102 [2025-03-17 05:52:50,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:52:50,668 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 249 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:50,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1453 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:52:50,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7102 states. [2025-03-17 05:52:51,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7102 to 6274. [2025-03-17 05:52:51,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6274 states, 5843 states have (on average 1.156768783159336) internal successors, (6759), 5871 states have internal predecessors, (6759), 330 states have call successors, (330), 100 states have call predecessors, (330), 100 states have return successors, (330), 302 states have call predecessors, (330), 330 states have call successors, (330) [2025-03-17 05:52:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6274 states to 6274 states and 7419 transitions. [2025-03-17 05:52:51,127 INFO L78 Accepts]: Start accepts. Automaton has 6274 states and 7419 transitions. Word has length 160 [2025-03-17 05:52:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:51,127 INFO L471 AbstractCegarLoop]: Abstraction has 6274 states and 7419 transitions. [2025-03-17 05:52:51,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 6274 states and 7419 transitions. [2025-03-17 05:52:51,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:52:51,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:51,132 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:51,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 05:52:51,132 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:51,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:51,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1552920111, now seen corresponding path program 1 times [2025-03-17 05:52:51,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:51,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558703092] [2025-03-17 05:52:51,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:51,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:51,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:52:51,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:52:51,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:51,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:52:51,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:51,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558703092] [2025-03-17 05:52:51,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558703092] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:52:51,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423403409] [2025-03-17 05:52:51,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:51,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:52:51,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:52:51,280 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-17 05:52:51,281 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-17 05:52:51,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:52:51,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:52:51,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:51,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:51,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 05:52:51,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:52:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:51,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:52:51,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423403409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:51,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:52:51,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 9 [2025-03-17 05:52:51,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288055451] [2025-03-17 05:52:51,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:51,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:52:51,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:51,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:52:51,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:52:51,483 INFO L87 Difference]: Start difference. First operand 6274 states and 7419 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:51,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:51,915 INFO L93 Difference]: Finished difference Result 6396 states and 7570 transitions. [2025-03-17 05:52:51,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:52:51,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-03-17 05:52:51,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:51,924 INFO L225 Difference]: With dead ends: 6396 [2025-03-17 05:52:51,924 INFO L226 Difference]: Without dead ends: 6394 [2025-03-17 05:52:51,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:52:51,927 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:51,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 710 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:52:51,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6394 states. [2025-03-17 05:52:52,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6394 to 6394. [2025-03-17 05:52:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6394 states, 5963 states have (on average 1.1536139527083682) internal successors, (6879), 5991 states have internal predecessors, (6879), 330 states have call successors, (330), 100 states have call predecessors, (330), 100 states have return successors, (330), 302 states have call predecessors, (330), 330 states have call successors, (330) [2025-03-17 05:52:52,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6394 states to 6394 states and 7539 transitions. [2025-03-17 05:52:52,468 INFO L78 Accepts]: Start accepts. Automaton has 6394 states and 7539 transitions. Word has length 160 [2025-03-17 05:52:52,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:52,468 INFO L471 AbstractCegarLoop]: Abstraction has 6394 states and 7539 transitions. [2025-03-17 05:52:52,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 6394 states and 7539 transitions. [2025-03-17 05:52:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:52:52,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:52,477 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:52,485 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-17 05:52:52,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-17 05:52:52,678 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:52,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:52,678 INFO L85 PathProgramCache]: Analyzing trace with hash 223623069, now seen corresponding path program 1 times [2025-03-17 05:52:52,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:52,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773988379] [2025-03-17 05:52:52,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:52,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:52,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:52:52,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:52:52,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:52,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:53,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:53,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773988379] [2025-03-17 05:52:53,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773988379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:53,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:53,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:52:53,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383198325] [2025-03-17 05:52:53,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:53,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:52:53,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:53,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:52:53,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:52:53,043 INFO L87 Difference]: Start difference. First operand 6394 states and 7539 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:53,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:53,768 INFO L93 Difference]: Finished difference Result 11278 states and 13363 transitions. [2025-03-17 05:52:53,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:52:53,768 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-03-17 05:52:53,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:53,777 INFO L225 Difference]: With dead ends: 11278 [2025-03-17 05:52:53,778 INFO L226 Difference]: Without dead ends: 7177 [2025-03-17 05:52:53,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:52:53,782 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 126 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1803 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:53,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1803 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:52:53,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7177 states. [2025-03-17 05:52:54,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7177 to 6450. [2025-03-17 05:52:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6450 states, 6019 states have (on average 1.1521847482970593) internal successors, (6935), 6047 states have internal predecessors, (6935), 330 states have call successors, (330), 100 states have call predecessors, (330), 100 states have return successors, (330), 302 states have call predecessors, (330), 330 states have call successors, (330) [2025-03-17 05:52:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6450 states to 6450 states and 7595 transitions. [2025-03-17 05:52:54,265 INFO L78 Accepts]: Start accepts. Automaton has 6450 states and 7595 transitions. Word has length 160 [2025-03-17 05:52:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:54,266 INFO L471 AbstractCegarLoop]: Abstraction has 6450 states and 7595 transitions. [2025-03-17 05:52:54,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 6450 states and 7595 transitions. [2025-03-17 05:52:54,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:52:54,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:54,269 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:54,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-17 05:52:54,270 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:54,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:54,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2020574428, now seen corresponding path program 1 times [2025-03-17 05:52:54,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:54,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057364968] [2025-03-17 05:52:54,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:54,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:54,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:52:54,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:52:54,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:54,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:54,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:54,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057364968] [2025-03-17 05:52:54,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057364968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:54,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:54,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:52:54,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057316910] [2025-03-17 05:52:54,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:54,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:52:54,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:54,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:52:54,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:52:54,422 INFO L87 Difference]: Start difference. First operand 6450 states and 7595 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:55,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:55,043 INFO L93 Difference]: Finished difference Result 11086 states and 13056 transitions. [2025-03-17 05:52:55,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:52:55,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-03-17 05:52:55,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:55,053 INFO L225 Difference]: With dead ends: 11086 [2025-03-17 05:52:55,053 INFO L226 Difference]: Without dead ends: 6913 [2025-03-17 05:52:55,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:52:55,058 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 75 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:55,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 656 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:52:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6913 states. [2025-03-17 05:52:55,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6913 to 6908. [2025-03-17 05:52:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6908 states, 6358 states have (on average 1.1472161056936143) internal successors, (7294), 6396 states have internal predecessors, (7294), 420 states have call successors, (420), 129 states have call predecessors, (420), 129 states have return successors, (420), 382 states have call predecessors, (420), 420 states have call successors, (420) [2025-03-17 05:52:55,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6908 states to 6908 states and 8134 transitions. [2025-03-17 05:52:55,672 INFO L78 Accepts]: Start accepts. Automaton has 6908 states and 8134 transitions. Word has length 160 [2025-03-17 05:52:55,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:55,672 INFO L471 AbstractCegarLoop]: Abstraction has 6908 states and 8134 transitions. [2025-03-17 05:52:55,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:55,673 INFO L276 IsEmpty]: Start isEmpty. Operand 6908 states and 8134 transitions. [2025-03-17 05:52:55,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:52:55,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:55,676 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:55,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-17 05:52:55,677 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:55,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:55,677 INFO L85 PathProgramCache]: Analyzing trace with hash 505196691, now seen corresponding path program 1 times [2025-03-17 05:52:55,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:55,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948779833] [2025-03-17 05:52:55,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:55,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:55,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:52:55,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:52:55,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:55,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:56,204 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:56,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:56,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948779833] [2025-03-17 05:52:56,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948779833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:56,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:56,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:52:56,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530033050] [2025-03-17 05:52:56,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:56,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:52:56,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:56,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:52:56,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:52:56,205 INFO L87 Difference]: Start difference. First operand 6908 states and 8134 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:57,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:57,178 INFO L93 Difference]: Finished difference Result 11814 states and 13910 transitions. [2025-03-17 05:52:57,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:52:57,179 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-03-17 05:52:57,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:57,188 INFO L225 Difference]: With dead ends: 11814 [2025-03-17 05:52:57,188 INFO L226 Difference]: Without dead ends: 7383 [2025-03-17 05:52:57,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:52:57,192 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 221 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:57,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1813 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:52:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7383 states. [2025-03-17 05:52:57,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7383 to 6530. [2025-03-17 05:52:57,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6530 states, 5980 states have (on average 1.1444816053511706) internal successors, (6844), 6018 states have internal predecessors, (6844), 420 states have call successors, (420), 129 states have call predecessors, (420), 129 states have return successors, (420), 382 states have call predecessors, (420), 420 states have call successors, (420) [2025-03-17 05:52:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6530 states to 6530 states and 7684 transitions. [2025-03-17 05:52:57,783 INFO L78 Accepts]: Start accepts. Automaton has 6530 states and 7684 transitions. Word has length 160 [2025-03-17 05:52:57,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:57,784 INFO L471 AbstractCegarLoop]: Abstraction has 6530 states and 7684 transitions. [2025-03-17 05:52:57,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:57,784 INFO L276 IsEmpty]: Start isEmpty. Operand 6530 states and 7684 transitions. [2025-03-17 05:52:57,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:52:57,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:57,786 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:57,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-17 05:52:57,787 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:57,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:57,787 INFO L85 PathProgramCache]: Analyzing trace with hash 855996628, now seen corresponding path program 1 times [2025-03-17 05:52:57,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:57,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506292972] [2025-03-17 05:52:57,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:57,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:57,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:52:57,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:52:57,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:57,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:57,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:57,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506292972] [2025-03-17 05:52:57,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506292972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:57,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:57,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:52:57,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043349561] [2025-03-17 05:52:57,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:57,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:52:57,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:57,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:52:57,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:52:57,917 INFO L87 Difference]: Start difference. First operand 6530 states and 7684 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:58,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:58,573 INFO L93 Difference]: Finished difference Result 10804 states and 12700 transitions. [2025-03-17 05:52:58,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:52:58,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-03-17 05:52:58,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:58,583 INFO L225 Difference]: With dead ends: 10804 [2025-03-17 05:52:58,583 INFO L226 Difference]: Without dead ends: 6583 [2025-03-17 05:52:58,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:52:58,588 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 143 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:58,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 613 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:52:58,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6583 states. [2025-03-17 05:52:58,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6583 to 5526. [2025-03-17 05:52:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5526 states, 5218 states have (on average 1.1498658489842852) internal successors, (6000), 5236 states have internal predecessors, (6000), 234 states have call successors, (234), 73 states have call predecessors, (234), 73 states have return successors, (234), 216 states have call predecessors, (234), 234 states have call successors, (234) [2025-03-17 05:52:58,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5526 states to 5526 states and 6468 transitions. [2025-03-17 05:52:58,983 INFO L78 Accepts]: Start accepts. Automaton has 5526 states and 6468 transitions. Word has length 160 [2025-03-17 05:52:58,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:58,983 INFO L471 AbstractCegarLoop]: Abstraction has 5526 states and 6468 transitions. [2025-03-17 05:52:58,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:58,983 INFO L276 IsEmpty]: Start isEmpty. Operand 5526 states and 6468 transitions. [2025-03-17 05:52:58,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:52:58,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:58,985 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:58,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-17 05:52:58,986 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:58,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:58,986 INFO L85 PathProgramCache]: Analyzing trace with hash -940954731, now seen corresponding path program 1 times [2025-03-17 05:52:58,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:58,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550744638] [2025-03-17 05:52:58,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:58,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:58,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:52:59,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:52:59,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:59,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:59,359 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:52:59,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:59,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550744638] [2025-03-17 05:52:59,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550744638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:59,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:59,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:52:59,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942268906] [2025-03-17 05:52:59,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:59,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:52:59,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:59,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:52:59,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:52:59,361 INFO L87 Difference]: Start difference. First operand 5526 states and 6468 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:52:59,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:59,994 INFO L93 Difference]: Finished difference Result 9752 states and 11462 transitions. [2025-03-17 05:52:59,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:52:59,995 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-03-17 05:52:59,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:53:00,006 INFO L225 Difference]: With dead ends: 9752 [2025-03-17 05:53:00,007 INFO L226 Difference]: Without dead ends: 6199 [2025-03-17 05:53:00,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:53:00,012 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 120 mSDsluCounter, 1806 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:53:00,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 2079 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:53:00,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6199 states. [2025-03-17 05:53:00,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6199 to 6050. [2025-03-17 05:53:00,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6050 states, 5596 states have (on average 1.1422444603288062) internal successors, (6392), 5624 states have internal predecessors, (6392), 346 states have call successors, (346), 107 states have call predecessors, (346), 107 states have return successors, (346), 318 states have call predecessors, (346), 346 states have call successors, (346) [2025-03-17 05:53:00,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6050 states to 6050 states and 7084 transitions. [2025-03-17 05:53:00,722 INFO L78 Accepts]: Start accepts. Automaton has 6050 states and 7084 transitions. Word has length 160 [2025-03-17 05:53:00,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:53:00,722 INFO L471 AbstractCegarLoop]: Abstraction has 6050 states and 7084 transitions. [2025-03-17 05:53:00,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:53:00,722 INFO L276 IsEmpty]: Start isEmpty. Operand 6050 states and 7084 transitions. [2025-03-17 05:53:00,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 05:53:00,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:53:00,726 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:53:00,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-17 05:53:00,726 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:53:00,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:53:00,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2095876465, now seen corresponding path program 1 times [2025-03-17 05:53:00,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:53:00,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484088223] [2025-03-17 05:53:00,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:53:00,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:53:00,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 05:53:00,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 05:53:00,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:53:00,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:53:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:53:01,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:53:01,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484088223] [2025-03-17 05:53:01,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484088223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:53:01,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:53:01,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:53:01,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085376218] [2025-03-17 05:53:01,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:53:01,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:53:01,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:53:01,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:53:01,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:53:01,138 INFO L87 Difference]: Start difference. First operand 6050 states and 7084 transitions. Second operand has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 05:53:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:53:01,917 INFO L93 Difference]: Finished difference Result 9987 states and 11663 transitions. [2025-03-17 05:53:01,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:53:01,917 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2025-03-17 05:53:01,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:53:01,927 INFO L225 Difference]: With dead ends: 9987 [2025-03-17 05:53:01,927 INFO L226 Difference]: Without dead ends: 6016 [2025-03-17 05:53:01,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:53:01,932 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 240 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:53:01,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 613 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:53:01,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2025-03-17 05:53:02,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 5501. [2025-03-17 05:53:02,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5501 states, 5206 states have (on average 1.144256626968882) internal successors, (5957), 5219 states have internal predecessors, (5957), 220 states have call successors, (220), 74 states have call predecessors, (220), 74 states have return successors, (220), 207 states have call predecessors, (220), 220 states have call successors, (220) [2025-03-17 05:53:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5501 states to 5501 states and 6397 transitions. [2025-03-17 05:53:02,396 INFO L78 Accepts]: Start accepts. Automaton has 5501 states and 6397 transitions. Word has length 162 [2025-03-17 05:53:02,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:53:02,396 INFO L471 AbstractCegarLoop]: Abstraction has 5501 states and 6397 transitions. [2025-03-17 05:53:02,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 05:53:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 5501 states and 6397 transitions. [2025-03-17 05:53:02,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 05:53:02,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:53:02,399 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:53:02,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-17 05:53:02,400 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:53:02,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:53:02,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1954498424, now seen corresponding path program 1 times [2025-03-17 05:53:02,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:53:02,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167114511] [2025-03-17 05:53:02,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:53:02,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:53:02,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:53:02,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:53:02,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:53:02,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:53:02,621 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:53:02,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:53:02,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167114511] [2025-03-17 05:53:02,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167114511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:53:02,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:53:02,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:53:02,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635207959] [2025-03-17 05:53:02,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:53:02,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:53:02,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:53:02,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:53:02,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:53:02,623 INFO L87 Difference]: Start difference. First operand 5501 states and 6397 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:53:03,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:53:03,530 INFO L93 Difference]: Finished difference Result 12225 states and 14207 transitions. [2025-03-17 05:53:03,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:53:03,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 163 [2025-03-17 05:53:03,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:53:03,540 INFO L225 Difference]: With dead ends: 12225 [2025-03-17 05:53:03,540 INFO L226 Difference]: Without dead ends: 8587 [2025-03-17 05:53:03,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:53:03,545 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 97 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:53:03,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1014 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:53:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8587 states. [2025-03-17 05:53:04,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8587 to 7967. [2025-03-17 05:53:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7967 states, 7600 states have (on average 1.1442105263157896) internal successors, (8696), 7616 states have internal predecessors, (8696), 272 states have call successors, (272), 94 states have call predecessors, (272), 94 states have return successors, (272), 256 states have call predecessors, (272), 272 states have call successors, (272) [2025-03-17 05:53:04,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7967 states to 7967 states and 9240 transitions. [2025-03-17 05:53:04,105 INFO L78 Accepts]: Start accepts. Automaton has 7967 states and 9240 transitions. Word has length 163 [2025-03-17 05:53:04,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:53:04,105 INFO L471 AbstractCegarLoop]: Abstraction has 7967 states and 9240 transitions. [2025-03-17 05:53:04,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:53:04,105 INFO L276 IsEmpty]: Start isEmpty. Operand 7967 states and 9240 transitions. [2025-03-17 05:53:04,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 05:53:04,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:53:04,108 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:53:04,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-17 05:53:04,108 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:53:04,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:53:04,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1066994743, now seen corresponding path program 1 times [2025-03-17 05:53:04,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:53:04,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930753612] [2025-03-17 05:53:04,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:53:04,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:53:04,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:53:04,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:53:04,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:53:04,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:53:04,258 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:53:04,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:53:04,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930753612] [2025-03-17 05:53:04,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930753612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:53:04,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908350638] [2025-03-17 05:53:04,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:53:04,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:53:04,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:53:04,260 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-17 05:53:04,261 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-17 05:53:04,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:53:04,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:53:04,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:53:04,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:53:04,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:53:04,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:53:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:53:04,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:53:04,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908350638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:53:04,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:53:04,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2025-03-17 05:53:04,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690798222] [2025-03-17 05:53:04,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:53:04,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:53:04,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:53:04,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:53:04,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:53:04,487 INFO L87 Difference]: Start difference. First operand 7967 states and 9240 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:53:05,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:53:05,029 INFO L93 Difference]: Finished difference Result 8044 states and 9331 transitions. [2025-03-17 05:53:05,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:53:05,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 163 [2025-03-17 05:53:05,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:53:05,038 INFO L225 Difference]: With dead ends: 8044 [2025-03-17 05:53:05,038 INFO L226 Difference]: Without dead ends: 8042 [2025-03-17 05:53:05,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 162 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-17 05:53:05,040 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:53:05,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 840 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:53:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8042 states. [2025-03-17 05:53:05,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8042 to 7970. [2025-03-17 05:53:05,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7970 states, 7603 states have (on average 1.1437590424832302) internal successors, (8696), 7619 states have internal predecessors, (8696), 272 states have call successors, (272), 94 states have call predecessors, (272), 94 states have return successors, (272), 256 states have call predecessors, (272), 272 states have call successors, (272) [2025-03-17 05:53:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7970 states to 7970 states and 9240 transitions. [2025-03-17 05:53:05,586 INFO L78 Accepts]: Start accepts. Automaton has 7970 states and 9240 transitions. Word has length 163 [2025-03-17 05:53:05,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:53:05,586 INFO L471 AbstractCegarLoop]: Abstraction has 7970 states and 9240 transitions. [2025-03-17 05:53:05,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:53:05,586 INFO L276 IsEmpty]: Start isEmpty. Operand 7970 states and 9240 transitions. [2025-03-17 05:53:05,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 05:53:05,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:53:05,590 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:53:05,599 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-17 05:53:05,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:53:05,790 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:53:05,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:53:05,791 INFO L85 PathProgramCache]: Analyzing trace with hash 390168617, now seen corresponding path program 1 times [2025-03-17 05:53:05,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:53:05,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984278667] [2025-03-17 05:53:05,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:53:05,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:53:05,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:53:05,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:53:05,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:53:05,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:53:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:53:05,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:53:05,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984278667] [2025-03-17 05:53:05,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984278667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:53:05,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:53:05,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:53:05,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334591591] [2025-03-17 05:53:05,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:53:05,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:53:05,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:53:05,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:53:05,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:53:05,982 INFO L87 Difference]: Start difference. First operand 7970 states and 9240 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:53:06,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:53:06,957 INFO L93 Difference]: Finished difference Result 8761 states and 10173 transitions. [2025-03-17 05:53:06,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:53:06,957 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 163 [2025-03-17 05:53:06,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:53:06,967 INFO L225 Difference]: With dead ends: 8761 [2025-03-17 05:53:06,967 INFO L226 Difference]: Without dead ends: 8759 [2025-03-17 05:53:06,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:53:06,969 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 100 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:53:06,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1632 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:53:06,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8759 states. [2025-03-17 05:53:07,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8759 to 7892. [2025-03-17 05:53:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7892 states, 7525 states have (on average 1.1432558139534883) internal successors, (8603), 7541 states have internal predecessors, (8603), 272 states have call successors, (272), 94 states have call predecessors, (272), 94 states have return successors, (272), 256 states have call predecessors, (272), 272 states have call successors, (272) [2025-03-17 05:53:07,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7892 states to 7892 states and 9147 transitions. [2025-03-17 05:53:07,580 INFO L78 Accepts]: Start accepts. Automaton has 7892 states and 9147 transitions. Word has length 163 [2025-03-17 05:53:07,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:53:07,580 INFO L471 AbstractCegarLoop]: Abstraction has 7892 states and 9147 transitions. [2025-03-17 05:53:07,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:53:07,580 INFO L276 IsEmpty]: Start isEmpty. Operand 7892 states and 9147 transitions. [2025-03-17 05:53:07,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-03-17 05:53:07,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:53:07,587 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:53:07,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-17 05:53:07,587 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:53:07,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:53:07,588 INFO L85 PathProgramCache]: Analyzing trace with hash -105259380, now seen corresponding path program 1 times [2025-03-17 05:53:07,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:53:07,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661508541] [2025-03-17 05:53:07,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:53:07,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:53:07,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-17 05:53:07,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-17 05:53:07,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:53:07,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:53:08,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3196 backedges. 99 proven. 72 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2025-03-17 05:53:08,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:53:08,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661508541] [2025-03-17 05:53:08,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661508541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:53:08,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806861051] [2025-03-17 05:53:08,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:53:08,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:53:08,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:53:08,194 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-17 05:53:08,195 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-17 05:53:08,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-17 05:53:08,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-17 05:53:08,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:53:08,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:53:08,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 05:53:08,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:53:08,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:53:08,950 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 72 treesize of output 59 [2025-03-17 05:53:08,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 17 [2025-03-17 05:53:08,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2025-03-17 05:53:09,089 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 65 treesize of output 53 [2025-03-17 05:53:09,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 59 treesize of output 39 [2025-03-17 05:53:09,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3196 backedges. 3 proven. 190 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 05:53:09,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:53:09,305 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 37 treesize of output 33 [2025-03-17 05:53:09,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:53:09,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2025-03-17 05:53:09,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2025-03-17 05:53:09,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3196 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3172 trivial. 0 not checked. [2025-03-17 05:53:09,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806861051] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:53:09,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:53:09,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 19 [2025-03-17 05:53:09,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003748825] [2025-03-17 05:53:09,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:53:09,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:53:09,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:53:09,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:53:09,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:53:09,443 INFO L87 Difference]: Start difference. First operand 7892 states and 9147 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:53:10,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:53:10,515 INFO L93 Difference]: Finished difference Result 12878 states and 14932 transitions. [2025-03-17 05:53:10,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:53:10,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 317 [2025-03-17 05:53:10,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:53:10,519 INFO L225 Difference]: With dead ends: 12878 [2025-03-17 05:53:10,519 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 05:53:10,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:53:10,525 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 94 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:53:10,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1455 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:53:10,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 05:53:10,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 05:53:10,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 05:53:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 05:53:10,530 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 317 [2025-03-17 05:53:10,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:53:10,530 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 05:53:10,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:53:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 05:53:10,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 05:53:10,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:53:10,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 05:53:10,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:53:10,736 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:53:10,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.