./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 798a7b37 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-?-798a7b3-m [2025-03-04 01:34:21,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:34:21,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:34:21,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:34:21,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:34:21,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:34:21,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:34:21,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:34:21,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:34:21,124 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:34:21,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:34:21,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:34:21,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:34:21,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:34:21,125 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:34:21,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:34:21,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:34:21,125 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:34:21,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:34:21,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:34:21,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:34:21,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:34:21,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:34:21,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:34:21,126 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:34:21,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:34:21,126 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:34:21,126 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:34:21,126 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:34:21,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:34:21,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:34:21,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:34:21,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:34:21,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:34:21,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:34:21,127 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:34:21,127 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:34:21,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:34:21,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:34:21,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:34:21,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:34:21,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:34:21,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:34:21,128 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-04 01:34:21,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:34:21,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:34:21,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:34:21,349 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:34:21,349 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:34:21,351 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-04 01:34:22,504 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04017a6e3/02c13026ae1745f2a6d46c9970fe0194/FLAGe8732ec0f [2025-03-04 01:34:22,848 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:34:22,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-90.i [2025-03-04 01:34:22,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04017a6e3/02c13026ae1745f2a6d46c9970fe0194/FLAGe8732ec0f [2025-03-04 01:34:22,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04017a6e3/02c13026ae1745f2a6d46c9970fe0194 [2025-03-04 01:34:22,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:34:22,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:34:22,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:34:22,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:34:22,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:34:22,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:34:22" (1/1) ... [2025-03-04 01:34:22,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf0269b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:22, skipping insertion in model container [2025-03-04 01:34:22,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:34:22" (1/1) ... [2025-03-04 01:34:22,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:34:22,969 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-04 01:34:23,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:34:23,008 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:34:23,016 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-04 01:34:23,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:34:23,057 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:34:23,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:23 WrapperNode [2025-03-04 01:34:23,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:34:23,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:34:23,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:34:23,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:34:23,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:23" (1/1) ... [2025-03-04 01:34:23,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:23" (1/1) ... [2025-03-04 01:34:23,092 INFO L138 Inliner]: procedures = 26, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 503 [2025-03-04 01:34:23,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:34:23,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:34:23,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:34:23,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:34:23,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:23" (1/1) ... [2025-03-04 01:34:23,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:23" (1/1) ... [2025-03-04 01:34:23,104 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:23" (1/1) ... [2025-03-04 01:34:23,118 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-04 01:34:23,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:23" (1/1) ... [2025-03-04 01:34:23,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:23" (1/1) ... [2025-03-04 01:34:23,132 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:23" (1/1) ... [2025-03-04 01:34:23,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:23" (1/1) ... [2025-03-04 01:34:23,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:23" (1/1) ... [2025-03-04 01:34:23,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:23" (1/1) ... [2025-03-04 01:34:23,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:34:23,145 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:34:23,145 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:34:23,145 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:34:23,147 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:23" (1/1) ... [2025-03-04 01:34:23,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:34:23,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:34:23,169 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-04 01:34:23,173 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-04 01:34:23,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:34:23,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:34:23,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:34:23,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:34:23,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:34:23,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:34:23,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:34:23,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 01:34:23,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 01:34:23,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 01:34:23,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 01:34:23,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 01:34:23,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 01:34:23,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 01:34:23,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 01:34:23,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 01:34:23,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 01:34:23,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:34:23,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:34:23,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:34:23,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:34:23,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:34:23,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:34:23,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 01:34:23,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 01:34:23,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 01:34:23,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 01:34:23,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 01:34:23,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 01:34:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 01:34:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 01:34:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 01:34:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 01:34:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:34:23,190 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:34:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:34:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:34:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:34:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:34:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:34:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:34:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 01:34:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 01:34:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 01:34:23,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 01:34:23,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 01:34:23,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 01:34:23,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 01:34:23,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 01:34:23,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 01:34:23,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 01:34:23,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:34:23,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:34:23,298 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:34:23,299 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:34:23,614 INFO L1325 $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-04 01:34:23,658 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2025-03-04 01:34:23,658 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:34:23,667 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:34:23,668 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:34:23,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:34:23 BoogieIcfgContainer [2025-03-04 01:34:23,669 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:34:23,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:34:23,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:34:23,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:34:23,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:34:22" (1/3) ... [2025-03-04 01:34:23,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e64fc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:34:23, skipping insertion in model container [2025-03-04 01:34:23,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:23" (2/3) ... [2025-03-04 01:34:23,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e64fc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:34:23, skipping insertion in model container [2025-03-04 01:34:23,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:34:23" (3/3) ... [2025-03-04 01:34:23,676 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-90.i [2025-03-04 01:34:23,686 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:34:23,687 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-90.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:34:23,744 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:34:23,754 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;@75a5b255, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:34:23,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:34:23,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 87 states have (on average 1.367816091954023) internal successors, (119), 88 states have internal predecessors, (119), 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-04 01:34:23,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:34:23,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:23,769 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-04 01:34:23,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:23,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:23,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1065850823, now seen corresponding path program 1 times [2025-03-04 01:34:23,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:23,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010209581] [2025-03-04 01:34:23,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:23,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:23,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:34:23,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:34:23,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:23,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:24,125 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-04 01:34:24,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:24,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010209581] [2025-03-04 01:34:24,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010209581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:24,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306514291] [2025-03-04 01:34:24,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:24,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:24,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:34:24,128 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-04 01:34:24,130 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-04 01:34:24,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:34:24,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:34:24,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:24,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:24,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:34:24,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:24,338 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-04 01:34:24,338 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:34:24,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306514291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:24,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:34:24,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:34:24,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985156386] [2025-03-04 01:34:24,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:24,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:34:24,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:24,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:34:24,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:34:24,360 INFO L87 Difference]: Start difference. First operand has 110 states, 87 states have (on average 1.367816091954023) internal successors, (119), 88 states have internal predecessors, (119), 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 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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-04 01:34:24,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:24,378 INFO L93 Difference]: Finished difference Result 214 states and 333 transitions. [2025-03-04 01:34:24,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:34:24,379 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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 153 [2025-03-04 01:34:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:24,383 INFO L225 Difference]: With dead ends: 214 [2025-03-04 01:34:24,383 INFO L226 Difference]: Without dead ends: 107 [2025-03-04 01:34:24,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 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-04 01:34:24,387 INFO L435 NwaCegarLoop]: 154 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, 154 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-04 01:34:24,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:24,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-04 01:34:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-04 01:34:24,412 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-04 01:34:24,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2025-03-04 01:34:24,418 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 153 [2025-03-04 01:34:24,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:24,418 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2025-03-04 01:34:24,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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-04 01:34:24,418 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2025-03-04 01:34:24,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:34:24,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:24,420 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-04 01:34:24,427 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-04 01:34:24,620 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-04 01:34:24,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:24,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:24,623 INFO L85 PathProgramCache]: Analyzing trace with hash -639095885, now seen corresponding path program 1 times [2025-03-04 01:34:24,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:24,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722568983] [2025-03-04 01:34:24,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:24,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:24,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:34:24,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:34:24,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:24,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:25,039 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-04 01:34:25,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:25,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722568983] [2025-03-04 01:34:25,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722568983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:25,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357621109] [2025-03-04 01:34:25,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:25,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:25,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:34:25,041 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-04 01:34:25,044 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-04 01:34:25,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:34:25,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:34:25,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:25,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:25,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:34:25,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:25,293 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-04 01:34:25,293 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:34:25,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357621109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:25,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:34:25,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:34:25,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700360574] [2025-03-04 01:34:25,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:25,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:34:25,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:25,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:34:25,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:34:25,296 INFO L87 Difference]: Start difference. First operand 107 states and 154 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 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-04 01:34:25,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:25,338 INFO L93 Difference]: Finished difference Result 213 states and 308 transitions. [2025-03-04 01:34:25,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:34:25,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 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-04 01:34:25,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:25,342 INFO L225 Difference]: With dead ends: 213 [2025-03-04 01:34:25,344 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 01:34:25,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 154 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-04 01:34:25,345 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 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-04 01:34:25,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:25,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 01:34:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-04 01:34:25,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 87 states have internal predecessors, (116), 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-04 01:34:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2025-03-04 01:34:25,363 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 153 [2025-03-04 01:34:25,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:25,364 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2025-03-04 01:34:25,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 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-04 01:34:25,365 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2025-03-04 01:34:25,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:34:25,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:25,369 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-04 01:34:25,377 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-04 01:34:25,570 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-04 01:34:25,570 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:25,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:25,571 INFO L85 PathProgramCache]: Analyzing trace with hash -84478063, now seen corresponding path program 1 times [2025-03-04 01:34:25,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:25,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371787396] [2025-03-04 01:34:25,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:25,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:25,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:34:25,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:34:25,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:25,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:26,214 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-04 01:34:26,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:26,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371787396] [2025-03-04 01:34:26,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371787396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:26,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:26,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:34:26,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254369768] [2025-03-04 01:34:26,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:26,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:34:26,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:26,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:34:26,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:26,217 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-04 01:34:26,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:26,470 INFO L93 Difference]: Finished difference Result 311 states and 447 transitions. [2025-03-04 01:34:26,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:26,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 155 [2025-03-04 01:34:26,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:26,472 INFO L225 Difference]: With dead ends: 311 [2025-03-04 01:34:26,473 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 01:34:26,473 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-04 01:34:26,474 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 283 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 489 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-04 01:34:26,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 489 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:34:26,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 01:34:26,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 111. [2025-03-04 01:34:26,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 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-04 01:34:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2025-03-04 01:34:26,491 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 155 [2025-03-04 01:34:26,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:26,492 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2025-03-04 01:34:26,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-04 01:34:26,493 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2025-03-04 01:34:26,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:34:26,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:26,497 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-04 01:34:26,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:34:26,497 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:26,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:26,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1845309197, now seen corresponding path program 1 times [2025-03-04 01:34:26,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:26,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268626929] [2025-03-04 01:34:26,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:26,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:26,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:34:26,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:34:26,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:26,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:27,306 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-04 01:34:27,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:27,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268626929] [2025-03-04 01:34:27,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268626929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:27,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:27,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:34:27,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314789530] [2025-03-04 01:34:27,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:27,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:34:27,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:27,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:34:27,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:34:27,309 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 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-04 01:34:27,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:27,573 INFO L93 Difference]: Finished difference Result 226 states and 320 transitions. [2025-03-04 01:34:27,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:34:27,573 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 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-04 01:34:27,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:27,575 INFO L225 Difference]: With dead ends: 226 [2025-03-04 01:34:27,575 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 01:34:27,575 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-04 01:34:27,576 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 310 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:27,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 702 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:34:27,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 01:34:27,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-04 01:34:27,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.305263157894737) internal successors, (124), 95 states have internal predecessors, (124), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:34:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2025-03-04 01:34:27,594 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 156 [2025-03-04 01:34:27,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:27,594 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2025-03-04 01:34:27,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 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-04 01:34:27,595 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2025-03-04 01:34:27,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:34:27,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:27,596 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-04 01:34:27,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:34:27,596 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:27,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:27,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1364303633, now seen corresponding path program 1 times [2025-03-04 01:34:27,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:27,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481401114] [2025-03-04 01:34:27,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:27,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:27,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:34:27,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:34:27,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:27,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 54 proven. 54 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2025-03-04 01:34:28,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:28,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481401114] [2025-03-04 01:34:28,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481401114] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:28,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031328375] [2025-03-04 01:34:28,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:28,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:28,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:34:28,537 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-04 01:34:28,539 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-04 01:34:28,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:34:28,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:34:28,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:28,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:28,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 01:34:28,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:29,037 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-04 01:34:29,347 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-04 01:34:29,432 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-04 01:34:29,501 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-04 01:34:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2025-03-04 01:34:29,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:34:29,951 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-04 01:34:29,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031328375] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:29,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:34:29,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13, 15] total 31 [2025-03-04 01:34:29,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758491922] [2025-03-04 01:34:29,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:29,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:34:29,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:29,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:34:29,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=852, Unknown=0, NotChecked=0, Total=930 [2025-03-04 01:34:29,953 INFO L87 Difference]: Start difference. First operand 118 states and 164 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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-04 01:34:30,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:30,221 INFO L93 Difference]: Finished difference Result 289 states and 399 transitions. [2025-03-04 01:34:30,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:34:30,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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-04 01:34:30,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:30,224 INFO L225 Difference]: With dead ends: 289 [2025-03-04 01:34:30,224 INFO L226 Difference]: Without dead ends: 174 [2025-03-04 01:34:30,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 298 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=1094, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 01:34:30,226 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 67 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:30,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1150 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:30,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-04 01:34:30,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2025-03-04 01:34:30,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 143 states have (on average 1.3216783216783217) internal successors, (189), 144 states have internal predecessors, (189), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:34:30,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 233 transitions. [2025-03-04 01:34:30,244 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 233 transitions. Word has length 157 [2025-03-04 01:34:30,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:30,245 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 233 transitions. [2025-03-04 01:34:30,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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-04 01:34:30,245 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 233 transitions. [2025-03-04 01:34:30,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:34:30,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:30,246 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-04 01:34:30,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:34:30,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:30,447 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:30,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:30,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1869862258, now seen corresponding path program 1 times [2025-03-04 01:34:30,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:30,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901382126] [2025-03-04 01:34:30,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:30,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:30,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:34:30,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:34:30,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:30,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:30,752 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-04 01:34:30,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:30,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901382126] [2025-03-04 01:34:30,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901382126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:30,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:30,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:34:30,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859492221] [2025-03-04 01:34:30,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:30,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:34:30,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:30,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:34:30,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:30,754 INFO L87 Difference]: Start difference. First operand 169 states and 233 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (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-04 01:34:30,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:30,848 INFO L93 Difference]: Finished difference Result 344 states and 471 transitions. [2025-03-04 01:34:30,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:30,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (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-04 01:34:30,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:30,854 INFO L225 Difference]: With dead ends: 344 [2025-03-04 01:34:30,854 INFO L226 Difference]: Without dead ends: 178 [2025-03-04 01:34:30,854 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-04 01:34:30,855 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 62 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 838 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-04 01:34:30,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 838 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:30,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-04 01:34:30,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2025-03-04 01:34:30,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 141 states have internal predecessors, (184), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:34:30,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 228 transitions. [2025-03-04 01:34:30,865 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 228 transitions. Word has length 157 [2025-03-04 01:34:30,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:30,865 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 228 transitions. [2025-03-04 01:34:30,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (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-04 01:34:30,865 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 228 transitions. [2025-03-04 01:34:30,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:34:30,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:30,866 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-04 01:34:30,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:34:30,866 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:30,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:30,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1933591310, now seen corresponding path program 1 times [2025-03-04 01:34:30,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:30,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263508785] [2025-03-04 01:34:30,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:30,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:30,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:34:30,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:34:30,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:30,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:31,148 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-04 01:34:31,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:31,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263508785] [2025-03-04 01:34:31,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263508785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:31,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:31,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:34:31,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348947829] [2025-03-04 01:34:31,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:31,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:34:31,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:31,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:34:31,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:31,150 INFO L87 Difference]: Start difference. First operand 166 states and 228 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (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-04 01:34:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:31,243 INFO L93 Difference]: Finished difference Result 375 states and 513 transitions. [2025-03-04 01:34:31,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:31,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (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-04 01:34:31,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:31,246 INFO L225 Difference]: With dead ends: 375 [2025-03-04 01:34:31,246 INFO L226 Difference]: Without dead ends: 212 [2025-03-04 01:34:31,246 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-04 01:34:31,247 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 61 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 807 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-04 01:34:31,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 807 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:31,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-04 01:34:31,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 166. [2025-03-04 01:34:31,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.3071428571428572) internal successors, (183), 141 states have internal predecessors, (183), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:34:31,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 227 transitions. [2025-03-04 01:34:31,262 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 227 transitions. Word has length 157 [2025-03-04 01:34:31,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:31,263 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 227 transitions. [2025-03-04 01:34:31,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (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-04 01:34:31,263 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 227 transitions. [2025-03-04 01:34:31,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:34:31,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:31,264 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-04 01:34:31,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:34:31,264 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:31,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:31,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1428032685, now seen corresponding path program 1 times [2025-03-04 01:34:31,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:31,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577479372] [2025-03-04 01:34:31,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:31,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:31,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:34:31,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:34:31,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:31,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:31,942 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 54 proven. 54 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2025-03-04 01:34:31,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:31,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577479372] [2025-03-04 01:34:31,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577479372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:31,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142715481] [2025-03-04 01:34:31,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:31,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:31,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:34:31,944 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-04 01:34:31,946 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-04 01:34:32,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:34:32,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:34:32,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:32,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:32,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 01:34:32,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:32,149 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-04 01:34:32,197 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-04 01:34:32,234 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-04 01:34:32,370 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-04 01:34:32,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:34:32,570 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-04 01:34:32,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142715481] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:32,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:34:32,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13, 10] total 21 [2025-03-04 01:34:32,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318863173] [2025-03-04 01:34:32,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:32,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:34:32,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:32,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:34:32,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:34:32,571 INFO L87 Difference]: Start difference. First operand 166 states and 227 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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-04 01:34:32,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:32,865 INFO L93 Difference]: Finished difference Result 389 states and 528 transitions. [2025-03-04 01:34:32,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:34:32,867 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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-04 01:34:32,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:32,868 INFO L225 Difference]: With dead ends: 389 [2025-03-04 01:34:32,868 INFO L226 Difference]: Without dead ends: 226 [2025-03-04 01:34:32,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:34:32,869 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 73 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1361 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-04 01:34:32,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1361 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:32,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-04 01:34:32,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 219. [2025-03-04 01:34:32,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 187 states have internal predecessors, (241), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:34:32,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 297 transitions. [2025-03-04 01:34:32,888 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 297 transitions. Word has length 157 [2025-03-04 01:34:32,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:32,888 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 297 transitions. [2025-03-04 01:34:32,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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-04 01:34:32,888 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 297 transitions. [2025-03-04 01:34:32,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:34:32,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:32,890 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-04 01:34:32,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 01:34:33,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:33,095 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:33,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:33,095 INFO L85 PathProgramCache]: Analyzing trace with hash 110595026, now seen corresponding path program 1 times [2025-03-04 01:34:33,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:33,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901054538] [2025-03-04 01:34:33,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:33,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:33,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:34:33,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:34:33,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:33,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:33,206 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-04 01:34:33,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:33,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901054538] [2025-03-04 01:34:33,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901054538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:33,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:33,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:34:33,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861617458] [2025-03-04 01:34:33,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:33,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:34:33,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:33,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:34:33,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:33,209 INFO L87 Difference]: Start difference. First operand 219 states and 297 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-04 01:34:33,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:33,286 INFO L93 Difference]: Finished difference Result 573 states and 784 transitions. [2025-03-04 01:34:33,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:33,287 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-04 01:34:33,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:33,288 INFO L225 Difference]: With dead ends: 573 [2025-03-04 01:34:33,288 INFO L226 Difference]: Without dead ends: 357 [2025-03-04 01:34:33,289 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-04 01:34:33,289 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 62 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 668 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-04 01:34:33,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 668 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:33,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-04 01:34:33,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 259. [2025-03-04 01:34:33,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 225 states have (on average 1.3111111111111111) internal successors, (295), 227 states have internal predecessors, (295), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:34:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 351 transitions. [2025-03-04 01:34:33,306 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 351 transitions. Word has length 158 [2025-03-04 01:34:33,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:33,307 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 351 transitions. [2025-03-04 01:34:33,307 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-04 01:34:33,307 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 351 transitions. [2025-03-04 01:34:33,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:34:33,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:33,309 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-04 01:34:33,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:34:33,309 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:33,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:33,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1618146835, now seen corresponding path program 1 times [2025-03-04 01:34:33,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:33,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520865551] [2025-03-04 01:34:33,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:33,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:33,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:34:33,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:34:33,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:33,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:33,469 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-04 01:34:33,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:33,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520865551] [2025-03-04 01:34:33,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520865551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:33,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:33,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:33,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9223150] [2025-03-04 01:34:33,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:33,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:33,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:33,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:33,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:33,471 INFO L87 Difference]: Start difference. First operand 259 states and 351 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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-04 01:34:33,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:33,557 INFO L93 Difference]: Finished difference Result 676 states and 916 transitions. [2025-03-04 01:34:33,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:33,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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-04 01:34:33,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:33,560 INFO L225 Difference]: With dead ends: 676 [2025-03-04 01:34:33,560 INFO L226 Difference]: Without dead ends: 420 [2025-03-04 01:34:33,560 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-04 01:34:33,561 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 78 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:33,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 611 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-04 01:34:33,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 289. [2025-03-04 01:34:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 255 states have (on average 1.3098039215686275) internal successors, (334), 257 states have internal predecessors, (334), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:34:33,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 390 transitions. [2025-03-04 01:34:33,580 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 390 transitions. Word has length 158 [2025-03-04 01:34:33,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:33,581 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 390 transitions. [2025-03-04 01:34:33,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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-04 01:34:33,581 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 390 transitions. [2025-03-04 01:34:33,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:34:33,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:33,582 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-04 01:34:33,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:34:33,582 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:33,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:33,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1899508815, now seen corresponding path program 1 times [2025-03-04 01:34:33,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:33,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043878590] [2025-03-04 01:34:33,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:33,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:33,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:34:33,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:34:33,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:33,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:33,734 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-04 01:34:33,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:33,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043878590] [2025-03-04 01:34:33,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043878590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:33,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:33,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:33,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305734417] [2025-03-04 01:34:33,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:33,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:33,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:33,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:33,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:33,736 INFO L87 Difference]: Start difference. First operand 289 states and 390 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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-04 01:34:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:33,828 INFO L93 Difference]: Finished difference Result 663 states and 891 transitions. [2025-03-04 01:34:33,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:33,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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-04 01:34:33,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:33,833 INFO L225 Difference]: With dead ends: 663 [2025-03-04 01:34:33,833 INFO L226 Difference]: Without dead ends: 377 [2025-03-04 01:34:33,834 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-04 01:34:33,835 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 76 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 702 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-04 01:34:33,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 702 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:33,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-04 01:34:33,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 250. [2025-03-04 01:34:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 218 states have (on average 1.2889908256880733) internal successors, (281), 219 states have internal predecessors, (281), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:34:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 333 transitions. [2025-03-04 01:34:33,856 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 333 transitions. Word has length 158 [2025-03-04 01:34:33,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:33,856 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 333 transitions. [2025-03-04 01:34:33,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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-04 01:34:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 333 transitions. [2025-03-04 01:34:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:34:33,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:33,859 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-04 01:34:33,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:34:33,859 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:33,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:33,860 INFO L85 PathProgramCache]: Analyzing trace with hash -391957006, now seen corresponding path program 1 times [2025-03-04 01:34:33,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:33,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703464207] [2025-03-04 01:34:33,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:33,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:33,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:34:33,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:34:33,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:33,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:33,966 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-04 01:34:33,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:33,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703464207] [2025-03-04 01:34:33,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703464207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:33,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:33,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:34:33,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426523284] [2025-03-04 01:34:33,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:33,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:34:33,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:33,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:34:33,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:33,967 INFO L87 Difference]: Start difference. First operand 250 states and 333 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-04 01:34:34,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:34,038 INFO L93 Difference]: Finished difference Result 581 states and 776 transitions. [2025-03-04 01:34:34,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:34,038 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-04 01:34:34,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:34,041 INFO L225 Difference]: With dead ends: 581 [2025-03-04 01:34:34,041 INFO L226 Difference]: Without dead ends: 334 [2025-03-04 01:34:34,042 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-04 01:34:34,042 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 52 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 942 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-04 01:34:34,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 942 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:34,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-04 01:34:34,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 282. [2025-03-04 01:34:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 250 states have (on average 1.292) internal successors, (323), 251 states have internal predecessors, (323), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:34:34,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 375 transitions. [2025-03-04 01:34:34,064 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 375 transitions. Word has length 158 [2025-03-04 01:34:34,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:34,065 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 375 transitions. [2025-03-04 01:34:34,065 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-04 01:34:34,065 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 375 transitions. [2025-03-04 01:34:34,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-04 01:34:34,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:34,067 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] [2025-03-04 01:34:34,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:34:34,067 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:34,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:34,068 INFO L85 PathProgramCache]: Analyzing trace with hash -946520290, now seen corresponding path program 1 times [2025-03-04 01:34:34,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:34,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346702273] [2025-03-04 01:34:34,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:34,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:34,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 01:34:34,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 01:34:34,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:34,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:34,716 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-04 01:34:34,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:34,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346702273] [2025-03-04 01:34:34,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346702273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:34,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:34,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:34:34,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83213203] [2025-03-04 01:34:34,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:34,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:34:34,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:34,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:34:34,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:34:34,718 INFO L87 Difference]: Start difference. First operand 282 states and 375 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 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-04 01:34:35,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:35,114 INFO L93 Difference]: Finished difference Result 569 states and 757 transitions. [2025-03-04 01:34:35,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:34:35,114 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 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 159 [2025-03-04 01:34:35,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:35,116 INFO L225 Difference]: With dead ends: 569 [2025-03-04 01:34:35,116 INFO L226 Difference]: Without dead ends: 290 [2025-03-04 01:34:35,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:34:35,117 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 309 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:35,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 833 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:34:35,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-04 01:34:35,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 284. [2025-03-04 01:34:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 252 states have (on average 1.2896825396825398) internal successors, (325), 253 states have internal predecessors, (325), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:34:35,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 377 transitions. [2025-03-04 01:34:35,141 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 377 transitions. Word has length 159 [2025-03-04 01:34:35,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:35,141 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 377 transitions. [2025-03-04 01:34:35,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 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-04 01:34:35,141 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 377 transitions. [2025-03-04 01:34:35,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:34:35,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:35,143 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-04 01:34:35,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:34:35,143 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:35,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:35,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1084754729, now seen corresponding path program 1 times [2025-03-04 01:34:35,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:35,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782820381] [2025-03-04 01:34:35,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:35,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:35,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:34:35,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:34:35,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:35,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:35,289 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-04 01:34:35,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:35,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782820381] [2025-03-04 01:34:35,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782820381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:35,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:35,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:35,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010305166] [2025-03-04 01:34:35,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:35,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:35,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:35,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:35,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:35,291 INFO L87 Difference]: Start difference. First operand 284 states and 377 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-04 01:34:35,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:35,339 INFO L93 Difference]: Finished difference Result 725 states and 954 transitions. [2025-03-04 01:34:35,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:35,339 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-04 01:34:35,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:35,341 INFO L225 Difference]: With dead ends: 725 [2025-03-04 01:34:35,341 INFO L226 Difference]: Without dead ends: 444 [2025-03-04 01:34:35,342 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-04 01:34:35,342 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 47 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 583 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-04 01:34:35,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 583 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:35,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-04 01:34:35,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 404. [2025-03-04 01:34:35,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 372 states have (on average 1.271505376344086) internal successors, (473), 373 states have internal predecessors, (473), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:34:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 525 transitions. [2025-03-04 01:34:35,363 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 525 transitions. Word has length 160 [2025-03-04 01:34:35,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:35,364 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 525 transitions. [2025-03-04 01:34:35,364 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-04 01:34:35,364 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 525 transitions. [2025-03-04 01:34:35,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:34:35,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:35,366 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-04 01:34:35,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:34:35,367 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:35,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:35,367 INFO L85 PathProgramCache]: Analyzing trace with hash -2077806555, now seen corresponding path program 1 times [2025-03-04 01:34:35,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:35,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230508388] [2025-03-04 01:34:35,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:35,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:35,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:34:35,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:34:35,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:35,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:36,051 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-04 01:34:36,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:36,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230508388] [2025-03-04 01:34:36,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230508388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:36,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:36,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:34:36,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690021057] [2025-03-04 01:34:36,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:36,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:34:36,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:36,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:34:36,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:34:36,053 INFO L87 Difference]: Start difference. First operand 404 states and 525 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-04 01:34:36,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:36,382 INFO L93 Difference]: Finished difference Result 995 states and 1287 transitions. [2025-03-04 01:34:36,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:34:36,383 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-04 01:34:36,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:36,386 INFO L225 Difference]: With dead ends: 995 [2025-03-04 01:34:36,387 INFO L226 Difference]: Without dead ends: 594 [2025-03-04 01:34:36,388 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-04 01:34:36,389 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 306 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:36,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1164 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:34:36,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-04 01:34:36,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 531. [2025-03-04 01:34:36,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 474 states have (on average 1.2531645569620253) internal successors, (594), 477 states have internal predecessors, (594), 46 states have call successors, (46), 10 states have call predecessors, (46), 10 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:34:36,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 686 transitions. [2025-03-04 01:34:36,429 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 686 transitions. Word has length 160 [2025-03-04 01:34:36,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:36,429 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 686 transitions. [2025-03-04 01:34:36,429 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-04 01:34:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 686 transitions. [2025-03-04 01:34:36,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:34:36,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:36,431 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-04 01:34:36,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:34:36,431 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:36,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:36,432 INFO L85 PathProgramCache]: Analyzing trace with hash 420209382, now seen corresponding path program 1 times [2025-03-04 01:34:36,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:36,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043401083] [2025-03-04 01:34:36,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:36,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:36,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:34:36,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:34:36,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:36,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:36,627 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-04 01:34:36,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:36,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043401083] [2025-03-04 01:34:36,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043401083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:36,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:36,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:36,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410106827] [2025-03-04 01:34:36,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:36,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:36,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:36,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:36,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:36,628 INFO L87 Difference]: Start difference. First operand 531 states and 686 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-04 01:34:36,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:36,748 INFO L93 Difference]: Finished difference Result 1321 states and 1693 transitions. [2025-03-04 01:34:36,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:36,749 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-04 01:34:36,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:36,752 INFO L225 Difference]: With dead ends: 1321 [2025-03-04 01:34:36,752 INFO L226 Difference]: Without dead ends: 793 [2025-03-04 01:34:36,754 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-04 01:34:36,754 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 163 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:36,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 462 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:36,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-03-04 01:34:36,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 790. [2025-03-04 01:34:36,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 705 states have (on average 1.2326241134751772) internal successors, (869), 710 states have internal predecessors, (869), 68 states have call successors, (68), 16 states have call predecessors, (68), 16 states have return successors, (68), 63 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 01:34:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1005 transitions. [2025-03-04 01:34:36,808 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1005 transitions. Word has length 160 [2025-03-04 01:34:36,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:36,808 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1005 transitions. [2025-03-04 01:34:36,808 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-04 01:34:36,808 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1005 transitions. [2025-03-04 01:34:36,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:34:36,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:36,811 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-04 01:34:36,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:34:36,812 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:36,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:36,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1381823399, now seen corresponding path program 1 times [2025-03-04 01:34:36,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:36,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873708957] [2025-03-04 01:34:36,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:36,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:36,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:34:36,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:34:36,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:36,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:36,972 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-04 01:34:36,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:36,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873708957] [2025-03-04 01:34:36,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873708957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:36,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:36,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:36,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862393022] [2025-03-04 01:34:36,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:36,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:36,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:36,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:36,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:36,975 INFO L87 Difference]: Start difference. First operand 790 states and 1005 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-04 01:34:37,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:37,072 INFO L93 Difference]: Finished difference Result 1607 states and 2063 transitions. [2025-03-04 01:34:37,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:37,073 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-04 01:34:37,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:37,076 INFO L225 Difference]: With dead ends: 1607 [2025-03-04 01:34:37,078 INFO L226 Difference]: Without dead ends: 820 [2025-03-04 01:34:37,080 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-04 01:34:37,080 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 141 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1002 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-04 01:34:37,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1002 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:37,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2025-03-04 01:34:37,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 767. [2025-03-04 01:34:37,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 675 states have (on average 1.2296296296296296) internal successors, (830), 680 states have internal predecessors, (830), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 69 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-04 01:34:37,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 978 transitions. [2025-03-04 01:34:37,134 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 978 transitions. Word has length 160 [2025-03-04 01:34:37,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:37,134 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 978 transitions. [2025-03-04 01:34:37,134 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-04 01:34:37,134 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 978 transitions. [2025-03-04 01:34:37,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:34:37,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:37,136 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-04 01:34:37,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:34:37,137 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:37,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:37,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1866834387, now seen corresponding path program 1 times [2025-03-04 01:34:37,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:37,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112588025] [2025-03-04 01:34:37,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:37,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:37,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:34:37,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:34:37,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:37,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:37,735 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-04 01:34:37,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:37,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112588025] [2025-03-04 01:34:37,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112588025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:37,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:37,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:34:37,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247839219] [2025-03-04 01:34:37,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:37,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:34:37,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:37,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:34:37,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:34:37,737 INFO L87 Difference]: Start difference. First operand 767 states and 978 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-04 01:34:38,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:38,113 INFO L93 Difference]: Finished difference Result 1630 states and 2074 transitions. [2025-03-04 01:34:38,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:34:38,114 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-04 01:34:38,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:38,118 INFO L225 Difference]: With dead ends: 1630 [2025-03-04 01:34:38,118 INFO L226 Difference]: Without dead ends: 866 [2025-03-04 01:34:38,120 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-04 01:34:38,121 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 256 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:38,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1881 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:34:38,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2025-03-04 01:34:38,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 690. [2025-03-04 01:34:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 629 states have (on average 1.2337042925278219) internal successors, (776), 632 states have internal predecessors, (776), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 01:34:38,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 872 transitions. [2025-03-04 01:34:38,166 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 872 transitions. Word has length 160 [2025-03-04 01:34:38,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:38,167 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 872 transitions. [2025-03-04 01:34:38,167 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-04 01:34:38,167 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 872 transitions. [2025-03-04 01:34:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:34:38,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:38,169 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-04 01:34:38,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:34:38,169 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:38,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:38,170 INFO L85 PathProgramCache]: Analyzing trace with hash 631181550, now seen corresponding path program 1 times [2025-03-04 01:34:38,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:38,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641126047] [2025-03-04 01:34:38,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:38,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:38,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:34:38,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:34:38,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:38,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:38,349 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-04 01:34:38,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:38,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641126047] [2025-03-04 01:34:38,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641126047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:38,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:38,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:38,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918700165] [2025-03-04 01:34:38,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:38,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:38,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:38,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:38,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:38,352 INFO L87 Difference]: Start difference. First operand 690 states and 872 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-04 01:34:38,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:38,429 INFO L93 Difference]: Finished difference Result 1631 states and 2059 transitions. [2025-03-04 01:34:38,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:38,430 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-04 01:34:38,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:38,433 INFO L225 Difference]: With dead ends: 1631 [2025-03-04 01:34:38,433 INFO L226 Difference]: Without dead ends: 944 [2025-03-04 01:34:38,434 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-04 01:34:38,435 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 88 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:38,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 740 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:38,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-03-04 01:34:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 941. [2025-03-04 01:34:38,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 857 states have (on average 1.2287047841306884) internal successors, (1053), 862 states have internal predecessors, (1053), 66 states have call successors, (66), 17 states have call predecessors, (66), 17 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:34:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1185 transitions. [2025-03-04 01:34:38,486 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1185 transitions. Word has length 160 [2025-03-04 01:34:38,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:38,487 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1185 transitions. [2025-03-04 01:34:38,487 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-04 01:34:38,487 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1185 transitions. [2025-03-04 01:34:38,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:34:38,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:38,489 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-04 01:34:38,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:34:38,489 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:38,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:38,490 INFO L85 PathProgramCache]: Analyzing trace with hash -734428375, now seen corresponding path program 1 times [2025-03-04 01:34:38,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:38,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034878208] [2025-03-04 01:34:38,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:38,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:38,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:34:38,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:34:38,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:38,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:38,620 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-04 01:34:38,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:38,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034878208] [2025-03-04 01:34:38,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034878208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:38,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:38,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:38,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773208261] [2025-03-04 01:34:38,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:38,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:38,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:38,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:38,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:38,623 INFO L87 Difference]: Start difference. First operand 941 states and 1185 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-04 01:34:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:38,698 INFO L93 Difference]: Finished difference Result 1913 states and 2410 transitions. [2025-03-04 01:34:38,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:38,698 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-04 01:34:38,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:38,703 INFO L225 Difference]: With dead ends: 1913 [2025-03-04 01:34:38,703 INFO L226 Difference]: Without dead ends: 975 [2025-03-04 01:34:38,704 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-04 01:34:38,704 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 49 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 679 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-04 01:34:38,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 679 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:38,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-04 01:34:38,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 937. [2025-03-04 01:34:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 853 states have (on average 1.2203985932004688) internal successors, (1041), 858 states have internal predecessors, (1041), 66 states have call successors, (66), 17 states have call predecessors, (66), 17 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:34:38,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1173 transitions. [2025-03-04 01:34:38,763 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1173 transitions. Word has length 160 [2025-03-04 01:34:38,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:38,764 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1173 transitions. [2025-03-04 01:34:38,764 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-04 01:34:38,764 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1173 transitions. [2025-03-04 01:34:38,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:34:38,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:38,766 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-04 01:34:38,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:34:38,766 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:38,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:38,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1592795567, now seen corresponding path program 1 times [2025-03-04 01:34:38,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:38,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433356156] [2025-03-04 01:34:38,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:38,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:38,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:34:38,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:34:38,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:38,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:38,896 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-04 01:34:38,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:38,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433356156] [2025-03-04 01:34:38,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433356156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:38,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:38,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:38,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29605710] [2025-03-04 01:34:38,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:38,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:38,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:38,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:38,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:38,899 INFO L87 Difference]: Start difference. First operand 937 states and 1173 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-04 01:34:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:38,997 INFO L93 Difference]: Finished difference Result 1997 states and 2522 transitions. [2025-03-04 01:34:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:38,997 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-04 01:34:38,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:39,001 INFO L225 Difference]: With dead ends: 1997 [2025-03-04 01:34:39,001 INFO L226 Difference]: Without dead ends: 1063 [2025-03-04 01:34:39,003 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-04 01:34:39,004 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 141 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 998 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-04 01:34:39,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 998 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2025-03-04 01:34:39,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 898. [2025-03-04 01:34:39,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 814 states have (on average 1.21990171990172) internal successors, (993), 819 states have internal predecessors, (993), 66 states have call successors, (66), 17 states have call predecessors, (66), 17 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:34:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1125 transitions. [2025-03-04 01:34:39,060 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1125 transitions. Word has length 160 [2025-03-04 01:34:39,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:39,060 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1125 transitions. [2025-03-04 01:34:39,060 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-04 01:34:39,060 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1125 transitions. [2025-03-04 01:34:39,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 01:34:39,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:39,063 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] [2025-03-04 01:34:39,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:34:39,063 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:39,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:39,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1882544349, now seen corresponding path program 1 times [2025-03-04 01:34:39,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:39,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334630931] [2025-03-04 01:34:39,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:39,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:39,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 01:34:39,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 01:34:39,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:39,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:39,536 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-04 01:34:39,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:39,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334630931] [2025-03-04 01:34:39,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334630931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:39,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:39,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:34:39,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432605641] [2025-03-04 01:34:39,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:39,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:34:39,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:39,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:34:39,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:34:39,539 INFO L87 Difference]: Start difference. First operand 898 states and 1125 transitions. Second operand has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 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-04 01:34:40,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:40,123 INFO L93 Difference]: Finished difference Result 2595 states and 3255 transitions. [2025-03-04 01:34:40,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:34:40,124 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 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 161 [2025-03-04 01:34:40,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:40,129 INFO L225 Difference]: With dead ends: 2595 [2025-03-04 01:34:40,129 INFO L226 Difference]: Without dead ends: 1700 [2025-03-04 01:34:40,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:34:40,134 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 417 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:40,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1026 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:34:40,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2025-03-04 01:34:40,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1128. [2025-03-04 01:34:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1044 states have (on average 1.225095785440613) internal successors, (1279), 1049 states have internal predecessors, (1279), 66 states have call successors, (66), 17 states have call predecessors, (66), 17 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:34:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1411 transitions. [2025-03-04 01:34:40,187 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1411 transitions. Word has length 161 [2025-03-04 01:34:40,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:40,187 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1411 transitions. [2025-03-04 01:34:40,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 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-04 01:34:40,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1411 transitions. [2025-03-04 01:34:40,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 01:34:40,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:40,190 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-04 01:34:40,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:34:40,190 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:40,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1477505415, now seen corresponding path program 1 times [2025-03-04 01:34:40,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:40,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460403897] [2025-03-04 01:34:40,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:40,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:40,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:34:40,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:34:40,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:40,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:40,403 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-04 01:34:40,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:40,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460403897] [2025-03-04 01:34:40,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460403897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:40,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:40,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:34:40,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9437070] [2025-03-04 01:34:40,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:40,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:34:40,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:40,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:34:40,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:40,405 INFO L87 Difference]: Start difference. First operand 1128 states and 1411 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-04 01:34:40,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:40,644 INFO L93 Difference]: Finished difference Result 2470 states and 3111 transitions. [2025-03-04 01:34:40,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:40,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 162 [2025-03-04 01:34:40,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:40,650 INFO L225 Difference]: With dead ends: 2470 [2025-03-04 01:34:40,650 INFO L226 Difference]: Without dead ends: 1345 [2025-03-04 01:34:40,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:34:40,654 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 284 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 819 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-04 01:34:40,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 819 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:34:40,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2025-03-04 01:34:40,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1187. [2025-03-04 01:34:40,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1085 states have (on average 1.1778801843317972) internal successors, (1278), 1091 states have internal predecessors, (1278), 80 states have call successors, (80), 21 states have call predecessors, (80), 21 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-04 01:34:40,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1438 transitions. [2025-03-04 01:34:40,711 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1438 transitions. Word has length 162 [2025-03-04 01:34:40,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:40,711 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1438 transitions. [2025-03-04 01:34:40,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-04 01:34:40,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1438 transitions. [2025-03-04 01:34:40,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 01:34:40,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:40,713 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-04 01:34:40,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:34:40,713 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:40,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:40,714 INFO L85 PathProgramCache]: Analyzing trace with hash -866185533, now seen corresponding path program 1 times [2025-03-04 01:34:40,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:40,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013242700] [2025-03-04 01:34:40,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:40,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:40,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:34:40,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:34:40,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:40,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:41,421 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-04 01:34:41,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:41,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013242700] [2025-03-04 01:34:41,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013242700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:41,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:41,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:34:41,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258214596] [2025-03-04 01:34:41,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:41,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:34:41,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:41,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:34:41,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:34:41,423 INFO L87 Difference]: Start difference. First operand 1187 states and 1438 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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-04 01:34:41,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:41,972 INFO L93 Difference]: Finished difference Result 4109 states and 4971 transitions. [2025-03-04 01:34:41,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 01:34:41,972 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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 162 [2025-03-04 01:34:41,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:41,982 INFO L225 Difference]: With dead ends: 4109 [2025-03-04 01:34:41,982 INFO L226 Difference]: Without dead ends: 2925 [2025-03-04 01:34:41,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:34:41,985 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 691 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:41,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1267 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:34:41,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2025-03-04 01:34:42,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1747. [2025-03-04 01:34:42,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1747 states, 1544 states have (on average 1.1651554404145077) internal successors, (1799), 1556 states have internal predecessors, (1799), 160 states have call successors, (160), 42 states have call predecessors, (160), 42 states have return successors, (160), 148 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-04 01:34:42,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 2119 transitions. [2025-03-04 01:34:42,098 INFO L78 Accepts]: Start accepts. Automaton has 1747 states and 2119 transitions. Word has length 162 [2025-03-04 01:34:42,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:42,098 INFO L471 AbstractCegarLoop]: Abstraction has 1747 states and 2119 transitions. [2025-03-04 01:34:42,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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-04 01:34:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2119 transitions. [2025-03-04 01:34:42,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 01:34:42,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:42,101 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-04 01:34:42,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:34:42,101 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:42,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:42,102 INFO L85 PathProgramCache]: Analyzing trace with hash 876624802, now seen corresponding path program 1 times [2025-03-04 01:34:42,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:42,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610279839] [2025-03-04 01:34:42,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:42,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:42,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:34:42,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:34:42,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:42,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:42,232 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-04 01:34:42,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:42,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610279839] [2025-03-04 01:34:42,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610279839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:42,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:42,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:34:42,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632407626] [2025-03-04 01:34:42,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:42,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:34:42,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:42,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:34:42,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:42,234 INFO L87 Difference]: Start difference. First operand 1747 states and 2119 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-04 01:34:42,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:42,411 INFO L93 Difference]: Finished difference Result 4360 states and 5241 transitions. [2025-03-04 01:34:42,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:42,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 162 [2025-03-04 01:34:42,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:42,420 INFO L225 Difference]: With dead ends: 4360 [2025-03-04 01:34:42,420 INFO L226 Difference]: Without dead ends: 2616 [2025-03-04 01:34:42,423 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-04 01:34:42,423 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 53 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 676 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-04 01:34:42,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 676 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:42,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2025-03-04 01:34:42,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 2467. [2025-03-04 01:34:42,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2264 states have (on average 1.1519434628975265) internal successors, (2608), 2276 states have internal predecessors, (2608), 160 states have call successors, (160), 42 states have call predecessors, (160), 42 states have return successors, (160), 148 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-04 01:34:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 2928 transitions. [2025-03-04 01:34:42,563 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 2928 transitions. Word has length 162 [2025-03-04 01:34:42,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:42,563 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 2928 transitions. [2025-03-04 01:34:42,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-04 01:34:42,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 2928 transitions. [2025-03-04 01:34:42,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 01:34:42,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:42,568 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-04 01:34:42,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:34:42,568 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:42,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:42,568 INFO L85 PathProgramCache]: Analyzing trace with hash -835165726, now seen corresponding path program 1 times [2025-03-04 01:34:42,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:42,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233906762] [2025-03-04 01:34:42,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:42,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:42,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:34:42,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:34:42,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:42,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:42,714 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-04 01:34:42,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:42,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233906762] [2025-03-04 01:34:42,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233906762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:42,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:42,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:34:42,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450303884] [2025-03-04 01:34:42,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:42,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:34:42,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:42,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:34:42,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:42,716 INFO L87 Difference]: Start difference. First operand 2467 states and 2928 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-04 01:34:42,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:42,904 INFO L93 Difference]: Finished difference Result 4529 states and 5372 transitions. [2025-03-04 01:34:42,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:42,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 162 [2025-03-04 01:34:42,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:42,912 INFO L225 Difference]: With dead ends: 4529 [2025-03-04 01:34:42,913 INFO L226 Difference]: Without dead ends: 2616 [2025-03-04 01:34:42,915 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-04 01:34:42,915 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 51 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 868 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-04 01:34:42,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 868 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:42,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2025-03-04 01:34:43,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 2467. [2025-03-04 01:34:43,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2264 states have (on average 1.148851590106007) internal successors, (2601), 2276 states have internal predecessors, (2601), 160 states have call successors, (160), 42 states have call predecessors, (160), 42 states have return successors, (160), 148 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-04 01:34:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 2921 transitions. [2025-03-04 01:34:43,083 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 2921 transitions. Word has length 162 [2025-03-04 01:34:43,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:43,083 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 2921 transitions. [2025-03-04 01:34:43,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-04 01:34:43,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 2921 transitions. [2025-03-04 01:34:43,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 01:34:43,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:43,088 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-04 01:34:43,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:34:43,090 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:43,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:43,090 INFO L85 PathProgramCache]: Analyzing trace with hash 907644609, now seen corresponding path program 1 times [2025-03-04 01:34:43,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:43,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118396978] [2025-03-04 01:34:43,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:43,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:43,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:34:43,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:34:43,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:43,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 54 proven. 54 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2025-03-04 01:34:43,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:43,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118396978] [2025-03-04 01:34:43,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118396978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:43,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480259899] [2025-03-04 01:34:43,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:43,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:43,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:34:43,817 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-04 01:34:43,819 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-04 01:34:43,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:34:44,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:34:44,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:44,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:44,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 01:34:44,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:44,660 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-03-04 01:34:44,660 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-04 01:34:44,697 INFO L349 Elim1Store]: treesize reduction 48, result has 15.8 percent of original size [2025-03-04 01:34:44,698 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-04 01:34:44,727 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 24 treesize of output 13 [2025-03-04 01:34:44,918 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-04 01:34:44,959 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-04 01:34:45,042 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-04 01:34:45,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:34:45,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480259899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:45,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:34:45,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 25 [2025-03-04 01:34:45,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868401263] [2025-03-04 01:34:45,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:45,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:34:45,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:45,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:34:45,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:34:45,043 INFO L87 Difference]: Start difference. First operand 2467 states and 2921 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 13 states have internal predecessors, (65), 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-04 01:34:46,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:46,060 INFO L93 Difference]: Finished difference Result 5660 states and 6719 transitions. [2025-03-04 01:34:46,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:34:46,060 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 13 states have internal predecessors, (65), 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 162 [2025-03-04 01:34:46,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:46,070 INFO L225 Difference]: With dead ends: 5660 [2025-03-04 01:34:46,071 INFO L226 Difference]: Without dead ends: 3747 [2025-03-04 01:34:46,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=1070, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 01:34:46,074 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 231 mSDsluCounter, 2164 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:46,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 2415 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:34:46,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3747 states. [2025-03-04 01:34:46,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3747 to 3720. [2025-03-04 01:34:46,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3720 states, 3393 states have (on average 1.1541408782788094) internal successors, (3916), 3412 states have internal predecessors, (3916), 258 states have call successors, (258), 68 states have call predecessors, (258), 68 states have return successors, (258), 239 states have call predecessors, (258), 258 states have call successors, (258) [2025-03-04 01:34:46,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 4432 transitions. [2025-03-04 01:34:46,250 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 4432 transitions. Word has length 162 [2025-03-04 01:34:46,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:46,250 INFO L471 AbstractCegarLoop]: Abstraction has 3720 states and 4432 transitions. [2025-03-04 01:34:46,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 13 states have internal predecessors, (65), 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-04 01:34:46,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 4432 transitions. [2025-03-04 01:34:46,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 01:34:46,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:46,254 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-04 01:34:46,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:34:46,454 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,SelfDestructingSolverStorable26 [2025-03-04 01:34:46,455 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:46,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:46,456 INFO L85 PathProgramCache]: Analyzing trace with hash -214379949, now seen corresponding path program 1 times [2025-03-04 01:34:46,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:46,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688405969] [2025-03-04 01:34:46,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:46,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:46,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:34:46,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:34:46,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:46,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:46,504 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-04 01:34:46,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:46,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688405969] [2025-03-04 01:34:46,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688405969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:46,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:46,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:34:46,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625551081] [2025-03-04 01:34:46,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:46,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:34:46,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:46,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:34:46,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:34:46,506 INFO L87 Difference]: Start difference. First operand 3720 states and 4432 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-04 01:34:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:46,757 INFO L93 Difference]: Finished difference Result 7409 states and 8848 transitions. [2025-03-04 01:34:46,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:34:46,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 162 [2025-03-04 01:34:46,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:46,777 INFO L225 Difference]: With dead ends: 7409 [2025-03-04 01:34:46,778 INFO L226 Difference]: Without dead ends: 5045 [2025-03-04 01:34:46,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:34:46,782 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 57 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:46,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 362 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:46,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5045 states. [2025-03-04 01:34:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5045 to 4402. [2025-03-04 01:34:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4402 states, 4075 states have (on average 1.1607361963190184) internal successors, (4730), 4094 states have internal predecessors, (4730), 258 states have call successors, (258), 68 states have call predecessors, (258), 68 states have return successors, (258), 239 states have call predecessors, (258), 258 states have call successors, (258) [2025-03-04 01:34:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4402 states to 4402 states and 5246 transitions. [2025-03-04 01:34:47,037 INFO L78 Accepts]: Start accepts. Automaton has 4402 states and 5246 transitions. Word has length 162 [2025-03-04 01:34:47,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:47,038 INFO L471 AbstractCegarLoop]: Abstraction has 4402 states and 5246 transitions. [2025-03-04 01:34:47,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-04 01:34:47,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4402 states and 5246 transitions. [2025-03-04 01:34:47,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 01:34:47,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:47,044 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-04 01:34:47,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 01:34:47,044 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:47,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:47,045 INFO L85 PathProgramCache]: Analyzing trace with hash 291178676, now seen corresponding path program 1 times [2025-03-04 01:34:47,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:47,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933515641] [2025-03-04 01:34:47,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:47,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:47,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:34:47,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:34:47,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:47,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:47,206 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-04 01:34:47,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:47,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933515641] [2025-03-04 01:34:47,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933515641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:47,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:47,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:34:47,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284511847] [2025-03-04 01:34:47,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:47,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:34:47,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:47,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:34:47,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:34:47,209 INFO L87 Difference]: Start difference. First operand 4402 states and 5246 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-04 01:34:47,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:47,462 INFO L93 Difference]: Finished difference Result 8260 states and 9794 transitions. [2025-03-04 01:34:47,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:34:47,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 162 [2025-03-04 01:34:47,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:47,476 INFO L225 Difference]: With dead ends: 8260 [2025-03-04 01:34:47,477 INFO L226 Difference]: Without dead ends: 5174 [2025-03-04 01:34:47,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-04 01:34:47,479 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 129 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 435 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-04 01:34:47,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 435 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:47,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5174 states. [2025-03-04 01:34:47,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5174 to 4364. [2025-03-04 01:34:47,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4364 states, 4037 states have (on average 1.1548179341094873) internal successors, (4662), 4056 states have internal predecessors, (4662), 258 states have call successors, (258), 68 states have call predecessors, (258), 68 states have return successors, (258), 239 states have call predecessors, (258), 258 states have call successors, (258) [2025-03-04 01:34:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4364 states to 4364 states and 5178 transitions. [2025-03-04 01:34:47,689 INFO L78 Accepts]: Start accepts. Automaton has 4364 states and 5178 transitions. Word has length 162 [2025-03-04 01:34:47,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:47,690 INFO L471 AbstractCegarLoop]: Abstraction has 4364 states and 5178 transitions. [2025-03-04 01:34:47,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-04 01:34:47,690 INFO L276 IsEmpty]: Start isEmpty. Operand 4364 states and 5178 transitions. [2025-03-04 01:34:47,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 01:34:47,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:47,693 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-04 01:34:47,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 01:34:47,693 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:47,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:47,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2070483506, now seen corresponding path program 1 times [2025-03-04 01:34:47,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:47,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104435745] [2025-03-04 01:34:47,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:47,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:47,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:34:47,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:34:47,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:47,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:48,114 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-04 01:34:48,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:48,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104435745] [2025-03-04 01:34:48,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104435745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:48,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:48,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:34:48,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152140278] [2025-03-04 01:34:48,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:48,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:34:48,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:48,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:34:48,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:34:48,116 INFO L87 Difference]: Start difference. First operand 4364 states and 5178 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 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-04 01:34:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:48,571 INFO L93 Difference]: Finished difference Result 7070 states and 8395 transitions. [2025-03-04 01:34:48,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:34:48,571 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 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 162 [2025-03-04 01:34:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:48,579 INFO L225 Difference]: With dead ends: 7070 [2025-03-04 01:34:48,579 INFO L226 Difference]: Without dead ends: 4356 [2025-03-04 01:34:48,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:34:48,583 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 193 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:48,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 933 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:34:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4356 states. [2025-03-04 01:34:48,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4356 to 4236. [2025-03-04 01:34:48,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4236 states, 3909 states have (on average 1.1511895625479662) internal successors, (4500), 3928 states have internal predecessors, (4500), 258 states have call successors, (258), 68 states have call predecessors, (258), 68 states have return successors, (258), 239 states have call predecessors, (258), 258 states have call successors, (258) [2025-03-04 01:34:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4236 states to 4236 states and 5016 transitions. [2025-03-04 01:34:48,768 INFO L78 Accepts]: Start accepts. Automaton has 4236 states and 5016 transitions. Word has length 162 [2025-03-04 01:34:48,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:48,768 INFO L471 AbstractCegarLoop]: Abstraction has 4236 states and 5016 transitions. [2025-03-04 01:34:48,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 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-04 01:34:48,768 INFO L276 IsEmpty]: Start isEmpty. Operand 4236 states and 5016 transitions. [2025-03-04 01:34:48,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 01:34:48,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:48,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, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:48,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 01:34:48,772 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:48,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:48,772 INFO L85 PathProgramCache]: Analyzing trace with hash 239642851, now seen corresponding path program 1 times [2025-03-04 01:34:48,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:48,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733346819] [2025-03-04 01:34:48,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:48,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:48,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:34:48,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:34:48,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:48,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:49,489 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-04 01:34:49,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:49,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733346819] [2025-03-04 01:34:49,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733346819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:49,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:49,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:34:49,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804175355] [2025-03-04 01:34:49,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:49,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:34:49,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:49,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:34:49,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:34:49,490 INFO L87 Difference]: Start difference. First operand 4236 states and 5016 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 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-04 01:34:50,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:50,133 INFO L93 Difference]: Finished difference Result 6668 states and 7889 transitions. [2025-03-04 01:34:50,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:34:50,134 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 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-04 01:34:50,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:50,143 INFO L225 Difference]: With dead ends: 6668 [2025-03-04 01:34:50,144 INFO L226 Difference]: Without dead ends: 4397 [2025-03-04 01:34:50,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:34:50,148 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 522 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:50,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 932 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:34:50,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4397 states. [2025-03-04 01:34:50,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4397 to 3706. [2025-03-04 01:34:50,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3706 states, 3480 states have (on average 1.1543103448275862) internal successors, (4017), 3493 states have internal predecessors, (4017), 178 states have call successors, (178), 47 states have call predecessors, (178), 47 states have return successors, (178), 165 states have call predecessors, (178), 178 states have call successors, (178) [2025-03-04 01:34:50,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 4373 transitions. [2025-03-04 01:34:50,363 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 4373 transitions. Word has length 162 [2025-03-04 01:34:50,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:50,364 INFO L471 AbstractCegarLoop]: Abstraction has 3706 states and 4373 transitions. [2025-03-04 01:34:50,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 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-04 01:34:50,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 4373 transitions. [2025-03-04 01:34:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 01:34:50,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:50,368 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, 1] [2025-03-04 01:34:50,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 01:34:50,368 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:50,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:50,368 INFO L85 PathProgramCache]: Analyzing trace with hash -609099927, now seen corresponding path program 1 times [2025-03-04 01:34:50,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:50,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456892885] [2025-03-04 01:34:50,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:50,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:50,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 01:34:50,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 01:34:50,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:50,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:50,987 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-04 01:34:50,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:50,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456892885] [2025-03-04 01:34:50,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456892885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:50,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:50,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:34:50,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802651977] [2025-03-04 01:34:50,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:50,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:34:50,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:50,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:34:50,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:34:50,989 INFO L87 Difference]: Start difference. First operand 3706 states and 4373 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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-04 01:34:51,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:51,408 INFO L93 Difference]: Finished difference Result 6208 states and 7326 transitions. [2025-03-04 01:34:51,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:34:51,408 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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 164 [2025-03-04 01:34:51,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:51,414 INFO L225 Difference]: With dead ends: 6208 [2025-03-04 01:34:51,414 INFO L226 Difference]: Without dead ends: 3818 [2025-03-04 01:34:51,418 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-04 01:34:51,418 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 173 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:51,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1745 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:34:51,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3818 states. [2025-03-04 01:34:51,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3818 to 3570. [2025-03-04 01:34:51,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3570 states, 3344 states have (on average 1.1531100478468899) internal successors, (3856), 3357 states have internal predecessors, (3856), 178 states have call successors, (178), 47 states have call predecessors, (178), 47 states have return successors, (178), 165 states have call predecessors, (178), 178 states have call successors, (178) [2025-03-04 01:34:51,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 3570 states and 4212 transitions. [2025-03-04 01:34:51,564 INFO L78 Accepts]: Start accepts. Automaton has 3570 states and 4212 transitions. Word has length 164 [2025-03-04 01:34:51,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:51,564 INFO L471 AbstractCegarLoop]: Abstraction has 3570 states and 4212 transitions. [2025-03-04 01:34:51,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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-04 01:34:51,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3570 states and 4212 transitions. [2025-03-04 01:34:51,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 01:34:51,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:51,568 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, 1] [2025-03-04 01:34:51,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 01:34:51,568 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:51,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:51,568 INFO L85 PathProgramCache]: Analyzing trace with hash 107475709, now seen corresponding path program 1 times [2025-03-04 01:34:51,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:51,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504660040] [2025-03-04 01:34:51,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:51,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:51,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 01:34:51,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 01:34:51,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:51,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:51,716 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-04 01:34:51,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:51,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504660040] [2025-03-04 01:34:51,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504660040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:51,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698588326] [2025-03-04 01:34:51,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:51,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:51,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:34:51,718 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-04 01:34:51,719 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-04 01:34:51,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 01:34:51,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 01:34:51,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:51,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:51,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:34:51,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:51,936 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-04 01:34:51,937 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:34:51,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698588326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:51,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:34:51,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2025-03-04 01:34:51,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979985906] [2025-03-04 01:34:51,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:51,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:34:51,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:51,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:34:51,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:34:51,938 INFO L87 Difference]: Start difference. First operand 3570 states and 4212 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-04 01:34:52,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:52,067 INFO L93 Difference]: Finished difference Result 3628 states and 4283 transitions. [2025-03-04 01:34:52,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:52,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 164 [2025-03-04 01:34:52,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:52,072 INFO L225 Difference]: With dead ends: 3628 [2025-03-04 01:34:52,072 INFO L226 Difference]: Without dead ends: 3626 [2025-03-04 01:34:52,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:34:52,073 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 730 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-04 01:34:52,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 730 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:52,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2025-03-04 01:34:52,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 3626. [2025-03-04 01:34:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3626 states, 3400 states have (on average 1.1505882352941177) internal successors, (3912), 3413 states have internal predecessors, (3912), 178 states have call successors, (178), 47 states have call predecessors, (178), 47 states have return successors, (178), 165 states have call predecessors, (178), 178 states have call successors, (178) [2025-03-04 01:34:52,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 3626 states and 4268 transitions. [2025-03-04 01:34:52,213 INFO L78 Accepts]: Start accepts. Automaton has 3626 states and 4268 transitions. Word has length 164 [2025-03-04 01:34:52,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:52,213 INFO L471 AbstractCegarLoop]: Abstraction has 3626 states and 4268 transitions. [2025-03-04 01:34:52,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-04 01:34:52,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3626 states and 4268 transitions. [2025-03-04 01:34:52,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 01:34:52,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:52,216 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, 1] [2025-03-04 01:34:52,228 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-04 01:34:52,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:52,417 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:52,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:52,417 INFO L85 PathProgramCache]: Analyzing trace with hash -258299990, now seen corresponding path program 1 times [2025-03-04 01:34:52,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:52,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426949988] [2025-03-04 01:34:52,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:52,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:52,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 01:34:52,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 01:34:52,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:52,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:52,605 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-04 01:34:52,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:52,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426949988] [2025-03-04 01:34:52,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426949988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:52,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:52,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:52,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115345030] [2025-03-04 01:34:52,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:52,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:52,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:52,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:52,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:52,607 INFO L87 Difference]: Start difference. First operand 3626 states and 4268 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-04 01:34:52,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:52,785 INFO L93 Difference]: Finished difference Result 6214 states and 7322 transitions. [2025-03-04 01:34:52,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:52,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 164 [2025-03-04 01:34:52,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:52,801 INFO L225 Difference]: With dead ends: 6214 [2025-03-04 01:34:52,801 INFO L226 Difference]: Without dead ends: 3864 [2025-03-04 01:34:52,804 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-04 01:34:52,809 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 89 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:52,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 772 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:52,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3864 states. [2025-03-04 01:34:52,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3864 to 3648. [2025-03-04 01:34:52,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3648 states, 3422 states have (on average 1.1502045587375804) internal successors, (3936), 3435 states have internal predecessors, (3936), 178 states have call successors, (178), 47 states have call predecessors, (178), 47 states have return successors, (178), 165 states have call predecessors, (178), 178 states have call successors, (178) [2025-03-04 01:34:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 4292 transitions. [2025-03-04 01:34:52,957 INFO L78 Accepts]: Start accepts. Automaton has 3648 states and 4292 transitions. Word has length 164 [2025-03-04 01:34:52,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:52,957 INFO L471 AbstractCegarLoop]: Abstraction has 3648 states and 4292 transitions. [2025-03-04 01:34:52,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-04 01:34:52,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3648 states and 4292 transitions. [2025-03-04 01:34:52,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 01:34:52,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:52,960 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, 1] [2025-03-04 01:34:52,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 01:34:52,960 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:52,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:52,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2055251349, now seen corresponding path program 1 times [2025-03-04 01:34:52,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:52,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180015478] [2025-03-04 01:34:52,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:52,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:52,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 01:34:52,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 01:34:52,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:52,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:53,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-04 01:34:53,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:53,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180015478] [2025-03-04 01:34:53,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180015478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:53,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:53,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:34:53,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976453913] [2025-03-04 01:34:53,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:53,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:34:53,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:53,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:34:53,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:34:53,446 INFO L87 Difference]: Start difference. First operand 3648 states and 4292 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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-04 01:34:53,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:53,788 INFO L93 Difference]: Finished difference Result 6327 states and 7475 transitions. [2025-03-04 01:34:53,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:34:53,788 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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 164 [2025-03-04 01:34:53,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:53,795 INFO L225 Difference]: With dead ends: 6327 [2025-03-04 01:34:53,795 INFO L226 Difference]: Without dead ends: 3977 [2025-03-04 01:34:53,799 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-04 01:34:53,799 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 122 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:53,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 2134 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:53,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3977 states. [2025-03-04 01:34:53,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3977 to 3876. [2025-03-04 01:34:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3876 states, 3586 states have (on average 1.1450083658672616) internal successors, (4106), 3603 states have internal predecessors, (4106), 228 states have call successors, (228), 61 states have call predecessors, (228), 61 states have return successors, (228), 211 states have call predecessors, (228), 228 states have call successors, (228) [2025-03-04 01:34:53,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3876 states to 3876 states and 4562 transitions. [2025-03-04 01:34:53,996 INFO L78 Accepts]: Start accepts. Automaton has 3876 states and 4562 transitions. Word has length 164 [2025-03-04 01:34:53,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:53,996 INFO L471 AbstractCegarLoop]: Abstraction has 3876 states and 4562 transitions. [2025-03-04 01:34:53,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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-04 01:34:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 3876 states and 4562 transitions. [2025-03-04 01:34:53,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 01:34:53,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:53,998 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, 1] [2025-03-04 01:34:53,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 01:34:53,998 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:53,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:53,999 INFO L85 PathProgramCache]: Analyzing trace with hash 555477873, now seen corresponding path program 1 times [2025-03-04 01:34:53,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:53,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5221977] [2025-03-04 01:34:53,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:53,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:54,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 01:34:54,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 01:34:54,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:54,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:54,470 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-04 01:34:54,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:54,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5221977] [2025-03-04 01:34:54,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5221977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:54,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:54,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:34:54,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319257162] [2025-03-04 01:34:54,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:54,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:34:54,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:54,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:34:54,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:34:54,471 INFO L87 Difference]: Start difference. First operand 3876 states and 4562 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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-04 01:34:55,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:55,005 INFO L93 Difference]: Finished difference Result 6368 states and 7485 transitions. [2025-03-04 01:34:55,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:34:55,005 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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 164 [2025-03-04 01:34:55,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:55,011 INFO L225 Difference]: With dead ends: 6368 [2025-03-04 01:34:55,011 INFO L226 Difference]: Without dead ends: 3896 [2025-03-04 01:34:55,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:34:55,014 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 198 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 2015 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:55,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 2015 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:34:55,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2025-03-04 01:34:55,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3630. [2025-03-04 01:34:55,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3630 states, 3370 states have (on average 1.144807121661721) internal successors, (3858), 3385 states have internal predecessors, (3858), 204 states have call successors, (204), 55 states have call predecessors, (204), 55 states have return successors, (204), 189 states have call predecessors, (204), 204 states have call successors, (204) [2025-03-04 01:34:55,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3630 states to 3630 states and 4266 transitions. [2025-03-04 01:34:55,189 INFO L78 Accepts]: Start accepts. Automaton has 3630 states and 4266 transitions. Word has length 164 [2025-03-04 01:34:55,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:55,189 INFO L471 AbstractCegarLoop]: Abstraction has 3630 states and 4266 transitions. [2025-03-04 01:34:55,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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-04 01:34:55,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3630 states and 4266 transitions. [2025-03-04 01:34:55,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 01:34:55,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:55,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, 1, 1, 1, 1] [2025-03-04 01:34:55,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 01:34:55,191 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:55,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:55,192 INFO L85 PathProgramCache]: Analyzing trace with hash 906277810, now seen corresponding path program 1 times [2025-03-04 01:34:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:55,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347717454] [2025-03-04 01:34:55,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:55,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:55,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 01:34:55,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 01:34:55,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:55,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:55,348 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-04 01:34:55,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:55,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347717454] [2025-03-04 01:34:55,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347717454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:55,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:55,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:55,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444032466] [2025-03-04 01:34:55,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:55,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:55,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:55,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:55,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:55,350 INFO L87 Difference]: Start difference. First operand 3630 states and 4266 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-04 01:34:55,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:55,554 INFO L93 Difference]: Finished difference Result 5983 states and 7022 transitions. [2025-03-04 01:34:55,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:55,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 164 [2025-03-04 01:34:55,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:55,560 INFO L225 Difference]: With dead ends: 5983 [2025-03-04 01:34:55,560 INFO L226 Difference]: Without dead ends: 3644 [2025-03-04 01:34:55,563 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-04 01:34:55,564 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 133 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:55,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 519 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:55,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2025-03-04 01:34:55,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3438. [2025-03-04 01:34:55,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3438 states, 3227 states have (on average 1.1450263402541059) internal successors, (3695), 3238 states have internal predecessors, (3695), 164 states have call successors, (164), 46 states have call predecessors, (164), 46 states have return successors, (164), 153 states have call predecessors, (164), 164 states have call successors, (164) [2025-03-04 01:34:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 4023 transitions. [2025-03-04 01:34:55,703 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 4023 transitions. Word has length 164 [2025-03-04 01:34:55,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:55,703 INFO L471 AbstractCegarLoop]: Abstraction has 3438 states and 4023 transitions. [2025-03-04 01:34:55,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-04 01:34:55,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 4023 transitions. [2025-03-04 01:34:55,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 01:34:55,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:55,705 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, 1] [2025-03-04 01:34:55,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 01:34:55,706 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:55,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:55,706 INFO L85 PathProgramCache]: Analyzing trace with hash -890673549, now seen corresponding path program 1 times [2025-03-04 01:34:55,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:55,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647487647] [2025-03-04 01:34:55,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:55,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:55,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 01:34:55,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 01:34:55,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:55,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:56,143 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-04 01:34:56,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:56,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647487647] [2025-03-04 01:34:56,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647487647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:56,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:56,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:34:56,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31675977] [2025-03-04 01:34:56,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:56,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:34:56,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:56,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:34:56,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:34:56,147 INFO L87 Difference]: Start difference. First operand 3438 states and 4023 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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-04 01:34:56,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:56,557 INFO L93 Difference]: Finished difference Result 5992 states and 7048 transitions. [2025-03-04 01:34:56,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:34:56,558 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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 164 [2025-03-04 01:34:56,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:56,563 INFO L225 Difference]: With dead ends: 5992 [2025-03-04 01:34:56,563 INFO L226 Difference]: Without dead ends: 3767 [2025-03-04 01:34:56,566 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-04 01:34:56,567 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 122 mSDsluCounter, 1987 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:56,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 2266 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:56,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3767 states. [2025-03-04 01:34:56,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3767 to 3410. [2025-03-04 01:34:56,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3410 states, 3199 states have (on average 1.1437949359174742) internal successors, (3659), 3210 states have internal predecessors, (3659), 164 states have call successors, (164), 46 states have call predecessors, (164), 46 states have return successors, (164), 153 states have call predecessors, (164), 164 states have call successors, (164) [2025-03-04 01:34:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3410 states to 3410 states and 3987 transitions. [2025-03-04 01:34:56,712 INFO L78 Accepts]: Start accepts. Automaton has 3410 states and 3987 transitions. Word has length 164 [2025-03-04 01:34:56,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:56,712 INFO L471 AbstractCegarLoop]: Abstraction has 3410 states and 3987 transitions. [2025-03-04 01:34:56,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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-04 01:34:56,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3410 states and 3987 transitions. [2025-03-04 01:34:56,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 01:34:56,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:56,715 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, 1, 1, 1] [2025-03-04 01:34:56,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-04 01:34:56,715 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:56,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:56,715 INFO L85 PathProgramCache]: Analyzing trace with hash 298242847, now seen corresponding path program 1 times [2025-03-04 01:34:56,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:56,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095111972] [2025-03-04 01:34:56,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:56,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:56,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 01:34:56,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 01:34:56,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:56,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:56,919 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-04 01:34:56,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:56,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095111972] [2025-03-04 01:34:56,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095111972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:56,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:56,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:56,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542003374] [2025-03-04 01:34:56,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:56,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:56,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:56,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:56,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:56,921 INFO L87 Difference]: Start difference. First operand 3410 states and 3987 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-04 01:34:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:57,263 INFO L93 Difference]: Finished difference Result 8827 states and 10275 transitions. [2025-03-04 01:34:57,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:57,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 166 [2025-03-04 01:34:57,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:57,271 INFO L225 Difference]: With dead ends: 8827 [2025-03-04 01:34:57,271 INFO L226 Difference]: Without dead ends: 6456 [2025-03-04 01:34:57,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-04 01:34:57,275 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 66 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:57,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 618 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:57,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6456 states. [2025-03-04 01:34:57,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6456 to 6448. [2025-03-04 01:34:57,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6448 states, 6129 states have (on average 1.138684940447055) internal successors, (6979), 6152 states have internal predecessors, (6979), 248 states have call successors, (248), 70 states have call predecessors, (248), 70 states have return successors, (248), 225 states have call predecessors, (248), 248 states have call successors, (248) [2025-03-04 01:34:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6448 states to 6448 states and 7475 transitions. [2025-03-04 01:34:57,521 INFO L78 Accepts]: Start accepts. Automaton has 6448 states and 7475 transitions. Word has length 166 [2025-03-04 01:34:57,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:57,521 INFO L471 AbstractCegarLoop]: Abstraction has 6448 states and 7475 transitions. [2025-03-04 01:34:57,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-04 01:34:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 6448 states and 7475 transitions. [2025-03-04 01:34:57,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-04 01:34:57,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:57,525 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, 1, 1, 1, 1] [2025-03-04 01:34:57,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 01:34:57,525 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:57,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:57,525 INFO L85 PathProgramCache]: Analyzing trace with hash -223584978, now seen corresponding path program 1 times [2025-03-04 01:34:57,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:57,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857658425] [2025-03-04 01:34:57,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:57,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:57,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 01:34:57,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 01:34:57,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:57,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:57,788 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-04 01:34:57,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:57,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857658425] [2025-03-04 01:34:57,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857658425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:57,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:57,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:34:57,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158682924] [2025-03-04 01:34:57,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:57,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:34:57,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:57,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:34:57,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:34:57,791 INFO L87 Difference]: Start difference. First operand 6448 states and 7475 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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-04 01:34:58,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:58,200 INFO L93 Difference]: Finished difference Result 9800 states and 11363 transitions. [2025-03-04 01:34:58,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:34:58,200 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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 167 [2025-03-04 01:34:58,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:58,213 INFO L225 Difference]: With dead ends: 9800 [2025-03-04 01:34:58,213 INFO L226 Difference]: Without dead ends: 9798 [2025-03-04 01:34:58,217 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-04 01:34:58,217 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 101 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:58,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1656 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:58,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9798 states. [2025-03-04 01:34:58,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9798 to 9126. [2025-03-04 01:34:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9126 states, 8807 states have (on average 1.1414783694788238) internal successors, (10053), 8830 states have internal predecessors, (10053), 248 states have call successors, (248), 70 states have call predecessors, (248), 70 states have return successors, (248), 225 states have call predecessors, (248), 248 states have call successors, (248) [2025-03-04 01:34:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9126 states to 9126 states and 10549 transitions. [2025-03-04 01:34:58,533 INFO L78 Accepts]: Start accepts. Automaton has 9126 states and 10549 transitions. Word has length 167 [2025-03-04 01:34:58,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:58,533 INFO L471 AbstractCegarLoop]: Abstraction has 9126 states and 10549 transitions. [2025-03-04 01:34:58,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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-04 01:34:58,533 INFO L276 IsEmpty]: Start isEmpty. Operand 9126 states and 10549 transitions. [2025-03-04 01:34:58,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-04 01:34:58,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:58,538 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, 1, 1, 1, 1] [2025-03-04 01:34:58,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-04 01:34:58,538 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:58,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:58,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1726715277, now seen corresponding path program 1 times [2025-03-04 01:34:58,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:58,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368597864] [2025-03-04 01:34:58,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:58,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:58,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 01:34:58,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 01:34:58,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:58,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:59,042 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-04 01:34:59,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:59,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368597864] [2025-03-04 01:34:59,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368597864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:59,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:59,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:34:59,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160687116] [2025-03-04 01:34:59,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:59,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:34:59,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:59,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:34:59,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:34:59,043 INFO L87 Difference]: Start difference. First operand 9126 states and 10549 transitions. Second operand has 11 states, 10 states have (on average 7.0) internal successors, (70), 11 states have internal predecessors, (70), 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-04 01:34:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:59,929 INFO L93 Difference]: Finished difference Result 15593 states and 18042 transitions. [2025-03-04 01:34:59,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:34:59,930 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.0) internal successors, (70), 11 states have internal predecessors, (70), 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 167 [2025-03-04 01:34:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:59,940 INFO L225 Difference]: With dead ends: 15593 [2025-03-04 01:34:59,940 INFO L226 Difference]: Without dead ends: 9468 [2025-03-04 01:34:59,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:34:59,947 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 437 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:59,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1048 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:34:59,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9468 states. [2025-03-04 01:35:00,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9468 to 8892. [2025-03-04 01:35:00,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8892 states, 8624 states have (on average 1.1416975881261595) internal successors, (9846), 8641 states have internal predecessors, (9846), 206 states have call successors, (206), 61 states have call predecessors, (206), 61 states have return successors, (206), 189 states have call predecessors, (206), 206 states have call successors, (206) [2025-03-04 01:35:00,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8892 states to 8892 states and 10258 transitions. [2025-03-04 01:35:00,209 INFO L78 Accepts]: Start accepts. Automaton has 8892 states and 10258 transitions. Word has length 167 [2025-03-04 01:35:00,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:35:00,209 INFO L471 AbstractCegarLoop]: Abstraction has 8892 states and 10258 transitions. [2025-03-04 01:35:00,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.0) internal successors, (70), 11 states have internal predecessors, (70), 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-04 01:35:00,209 INFO L276 IsEmpty]: Start isEmpty. Operand 8892 states and 10258 transitions. [2025-03-04 01:35:00,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-04 01:35:00,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:35:00,218 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:35:00,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-04 01:35:00,219 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:35:00,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:35:00,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1989339885, now seen corresponding path program 1 times [2025-03-04 01:35:00,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:35:00,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498491672] [2025-03-04 01:35:00,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:35:00,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:35:00,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-04 01:35:00,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-04 01:35:00,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:35:00,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:35:01,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3198 backedges. 102 proven. 174 refuted. 0 times theorem prover too weak. 2922 trivial. 0 not checked. [2025-03-04 01:35:01,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:35:01,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498491672] [2025-03-04 01:35:01,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498491672] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:35:01,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501614326] [2025-03-04 01:35:01,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:35:01,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:35:01,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:35:01,251 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-04 01:35:01,252 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-04 01:35:01,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-04 01:35:01,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-04 01:35:01,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:35:01,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:35:01,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 01:35:01,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:35:02,047 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-04 01:35:02,079 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-04 01:35:02,081 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-04 01:35:02,086 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-04 01:35:02,214 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-04 01:35:02,246 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-04 01:35:02,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3198 backedges. 3 proven. 191 refuted. 0 times theorem prover too weak. 3004 trivial. 0 not checked. [2025-03-04 01:35:02,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:35:02,459 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-04 01:35:02,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:35:02,466 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-04 01:35:02,489 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-04 01:35:02,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3198 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3174 trivial. 0 not checked. [2025-03-04 01:35:02,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501614326] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:35:02,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:35:02,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13, 9] total 21 [2025-03-04 01:35:02,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269562618] [2025-03-04 01:35:02,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:35:02,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:35:02,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:35:02,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:35:02,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:35:02,594 INFO L87 Difference]: Start difference. First operand 8892 states and 10258 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-04 01:35:03,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:35:03,155 INFO L93 Difference]: Finished difference Result 15373 states and 17758 transitions. [2025-03-04 01:35:03,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:35:03,155 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 323 [2025-03-04 01:35:03,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:35:03,157 INFO L225 Difference]: With dead ends: 15373 [2025-03-04 01:35:03,157 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 01:35:03,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:35:03,166 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 95 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1489 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-04 01:35:03,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1489 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:35:03,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 01:35:03,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 01:35:03,166 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-04 01:35:03,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 01:35:03,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 323 [2025-03-04 01:35:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:35:03,168 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 01:35:03,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-04 01:35:03,168 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 01:35:03,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 01:35:03,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:35:03,180 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-04 01:35:03,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:35:03,373 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] [2025-03-04 01:35:03,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 01:35:22,293 WARN L286 SmtUtils]: Spent 8.84s on a formula simplification. DAG size of input: 242 DAG size of output: 213 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)