./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-58.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 47d9c6f35709a52125d621eba0ec18ad6da014805bad20f4d26ed2a4fcb7a8f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:59:30,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:59:30,065 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:59:30,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:59:30,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:59:30,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:59:30,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:59:30,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:59:30,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:59:30,097 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:59:30,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:59:30,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:59:30,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:59:30,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:59:30,097 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:59:30,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:59:30,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:59:30,098 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:59:30,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:59:30,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:59:30,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:59:30,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:59:30,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:59:30,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:59:30,099 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:59:30,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:59:30,099 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:59:30,099 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:59:30,099 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:59:30,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:59:30,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:59:30,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:59:30,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:59:30,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:59:30,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:59:30,100 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:59:30,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:59:30,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:59:30,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:59:30,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:59:30,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:59:30,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:59:30,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:59:30,101 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 -> 47d9c6f35709a52125d621eba0ec18ad6da014805bad20f4d26ed2a4fcb7a8f5 [2025-03-17 05:59:30,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:59:30,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:59:30,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:59:30,338 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:59:30,338 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:59:30,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-58.i [2025-03-17 05:59:31,469 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b8dc2b7/1578abcefb37478dbfd53f3a2ae108b7/FLAGb25765d13 [2025-03-17 05:59:31,704 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:59:31,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-58.i [2025-03-17 05:59:31,714 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b8dc2b7/1578abcefb37478dbfd53f3a2ae108b7/FLAGb25765d13 [2025-03-17 05:59:32,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b8dc2b7/1578abcefb37478dbfd53f3a2ae108b7 [2025-03-17 05:59:32,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:59:32,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:59:32,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:59:32,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:59:32,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:59:32,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:59:32" (1/1) ... [2025-03-17 05:59:32,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218ff823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:32, skipping insertion in model container [2025-03-17 05:59:32,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:59:32" (1/1) ... [2025-03-17 05:59:32,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:59:32,147 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-s_file-58.i[916,929] [2025-03-17 05:59:32,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:59:32,191 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:59:32,198 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-s_file-58.i[916,929] [2025-03-17 05:59:32,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:59:32,249 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:59:32,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:32 WrapperNode [2025-03-17 05:59:32,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:59:32,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:59:32,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:59:32,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:59:32,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:32" (1/1) ... [2025-03-17 05:59:32,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:32" (1/1) ... [2025-03-17 05:59:32,292 INFO L138 Inliner]: procedures = 27, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 434 [2025-03-17 05:59:32,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:59:32,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:59:32,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:59:32,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:59:32,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:32" (1/1) ... [2025-03-17 05:59:32,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:32" (1/1) ... [2025-03-17 05:59:32,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:32" (1/1) ... [2025-03-17 05:59:32,329 INFO L175 MemorySlicer]: Split 126 memory accesses to 2 slices as follows [2, 124]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 27 writes are split as follows [0, 27]. [2025-03-17 05:59:32,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:32" (1/1) ... [2025-03-17 05:59:32,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:32" (1/1) ... [2025-03-17 05:59:32,342 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:32" (1/1) ... [2025-03-17 05:59:32,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:32" (1/1) ... [2025-03-17 05:59:32,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:32" (1/1) ... [2025-03-17 05:59:32,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:32" (1/1) ... [2025-03-17 05:59:32,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:59:32,351 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:59:32,351 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:59:32,351 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:59:32,352 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:32" (1/1) ... [2025-03-17 05:59:32,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:59:32,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:32,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:59:32,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:59:32,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:59:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 05:59:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 05:59:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:59:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:59:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:59:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:59:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:59:32,392 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:59:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:59:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:59:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:59:32,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:59:32,475 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:59:32,477 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:59:32,864 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~mem68#1;havoc property_#t~ite83#1;havoc property_#t~mem74#1;havoc property_#t~mem70#1;havoc property_#t~mem69#1;havoc property_#t~ite73#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~ite82#1;havoc property_#t~mem79#1;havoc property_#t~mem78#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~mem87#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite115#1;havoc property_#t~mem90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~short91#1;havoc property_#t~ite112#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite107#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~mem114#1;havoc property_#t~mem113#1;havoc property_#t~short116#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short126#1; [2025-03-17 05:59:32,893 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-03-17 05:59:32,893 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:59:32,902 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:59:32,903 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:59:32,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:59:32 BoogieIcfgContainer [2025-03-17 05:59:32,903 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:59:32,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:59:32,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:59:32,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:59:32,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:59:32" (1/3) ... [2025-03-17 05:59:32,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eff6328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:59:32, skipping insertion in model container [2025-03-17 05:59:32,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:32" (2/3) ... [2025-03-17 05:59:32,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eff6328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:59:32, skipping insertion in model container [2025-03-17 05:59:32,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:59:32" (3/3) ... [2025-03-17 05:59:32,911 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-58.i [2025-03-17 05:59:32,924 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:59:32,925 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-58.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:59:32,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:59:32,972 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;@2fa8aa07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:59:32,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:59:32,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 68 states have (on average 1.411764705882353) internal successors, (96), 69 states have internal predecessors, (96), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:59:32,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:59:32,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:32,987 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:32,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:32,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:32,993 INFO L85 PathProgramCache]: Analyzing trace with hash 859301109, now seen corresponding path program 1 times [2025-03-17 05:59:32,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:32,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747903309] [2025-03-17 05:59:32,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:32,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:33,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:59:33,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:59:33,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:33,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 05:59:33,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:33,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747903309] [2025-03-17 05:59:33,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747903309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:59:33,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479589164] [2025-03-17 05:59:33,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:33,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:33,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:33,269 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:59:33,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:59:33,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:59:33,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:59:33,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:33,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:33,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:59:33,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:59:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 05:59:33,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:59:33,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479589164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:33,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:59:33,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:59:33,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408373483] [2025-03-17 05:59:33,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:33,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:59:33,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:33,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:59:33,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:59:33,520 INFO L87 Difference]: Start difference. First operand has 86 states, 68 states have (on average 1.411764705882353) internal successors, (96), 69 states have internal predecessors, (96), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:59:33,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:33,543 INFO L93 Difference]: Finished difference Result 165 states and 259 transitions. [2025-03-17 05:59:33,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:59:33,545 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 112 [2025-03-17 05:59:33,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:33,550 INFO L225 Difference]: With dead ends: 165 [2025-03-17 05:59:33,552 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 05:59:33,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:59:33,558 INFO L435 NwaCegarLoop]: 114 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, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:33,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:59:33,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 05:59:33,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 05:59:33,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:59:33,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2025-03-17 05:59:33,587 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 112 [2025-03-17 05:59:33,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:33,588 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2025-03-17 05:59:33,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:59:33,588 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2025-03-17 05:59:33,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:59:33,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:33,592 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:33,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:59:33,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:59:33,793 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:33,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:33,793 INFO L85 PathProgramCache]: Analyzing trace with hash -118350138, now seen corresponding path program 1 times [2025-03-17 05:59:33,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:33,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036777755] [2025-03-17 05:59:33,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:33,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:33,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:59:33,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:59:33,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:33,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:59:34,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:34,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036777755] [2025-03-17 05:59:34,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036777755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:34,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:34,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:59:34,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102567164] [2025-03-17 05:59:34,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:34,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:59:34,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:34,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:59:34,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:59:34,090 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:59:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:34,115 INFO L93 Difference]: Finished difference Result 162 states and 231 transitions. [2025-03-17 05:59:34,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:59:34,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2025-03-17 05:59:34,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:34,119 INFO L225 Difference]: With dead ends: 162 [2025-03-17 05:59:34,120 INFO L226 Difference]: Without dead ends: 83 [2025-03-17 05:59:34,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:59:34,121 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:34,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 324 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:59:34,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-17 05:59:34,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-03-17 05:59:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 65 states have (on average 1.323076923076923) internal successors, (86), 65 states have internal predecessors, (86), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:59:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 116 transitions. [2025-03-17 05:59:34,129 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 116 transitions. Word has length 112 [2025-03-17 05:59:34,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:34,130 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 116 transitions. [2025-03-17 05:59:34,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:59:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 116 transitions. [2025-03-17 05:59:34,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:59:34,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:34,132 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:34,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:59:34,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:34,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:34,133 INFO L85 PathProgramCache]: Analyzing trace with hash -117426617, now seen corresponding path program 1 times [2025-03-17 05:59:34,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:34,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823613472] [2025-03-17 05:59:34,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:34,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:34,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:59:34,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:59:34,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:34,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:59:35,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:35,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823613472] [2025-03-17 05:59:35,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823613472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:35,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:35,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:59:35,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146894153] [2025-03-17 05:59:35,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:35,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:59:35,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:35,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:59:35,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:59:35,828 INFO L87 Difference]: Start difference. First operand 82 states and 116 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:59:36,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:36,177 INFO L93 Difference]: Finished difference Result 207 states and 292 transitions. [2025-03-17 05:59:36,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:59:36,180 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 112 [2025-03-17 05:59:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:36,181 INFO L225 Difference]: With dead ends: 207 [2025-03-17 05:59:36,181 INFO L226 Difference]: Without dead ends: 126 [2025-03-17 05:59:36,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:59:36,182 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 51 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:36,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 639 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:59:36,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-17 05:59:36,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 96. [2025-03-17 05:59:36,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 79 states have internal predecessors, (106), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:59:36,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 136 transitions. [2025-03-17 05:59:36,197 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 136 transitions. Word has length 112 [2025-03-17 05:59:36,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:36,198 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 136 transitions. [2025-03-17 05:59:36,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:59:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2025-03-17 05:59:36,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:59:36,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:36,200 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:36,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:59:36,200 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:36,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:36,204 INFO L85 PathProgramCache]: Analyzing trace with hash 11656102, now seen corresponding path program 1 times [2025-03-17 05:59:36,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:36,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374362298] [2025-03-17 05:59:36,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:36,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:36,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:59:36,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:59:36,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:36,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:59:37,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:37,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374362298] [2025-03-17 05:59:37,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374362298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:37,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:37,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:59:37,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777265510] [2025-03-17 05:59:37,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:37,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:59:37,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:37,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:59:37,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:59:37,666 INFO L87 Difference]: Start difference. First operand 96 states and 136 transitions. Second operand has 9 states, 6 states have (on average 6.666666666666667) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-17 05:59:38,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:38,238 INFO L93 Difference]: Finished difference Result 237 states and 332 transitions. [2025-03-17 05:59:38,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:59:38,238 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 6.666666666666667) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) Word has length 112 [2025-03-17 05:59:38,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:38,240 INFO L225 Difference]: With dead ends: 237 [2025-03-17 05:59:38,241 INFO L226 Difference]: Without dead ends: 142 [2025-03-17 05:59:38,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:59:38,243 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 69 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:38,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 424 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:59:38,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-17 05:59:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 130. [2025-03-17 05:59:38,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 110 states have (on average 1.3363636363636364) internal successors, (147), 111 states have internal predecessors, (147), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:59:38,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 181 transitions. [2025-03-17 05:59:38,261 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 181 transitions. Word has length 112 [2025-03-17 05:59:38,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:38,261 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 181 transitions. [2025-03-17 05:59:38,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 6.666666666666667) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-17 05:59:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 181 transitions. [2025-03-17 05:59:38,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:59:38,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:38,263 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:38,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:59:38,263 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:38,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:38,263 INFO L85 PathProgramCache]: Analyzing trace with hash -862274621, now seen corresponding path program 1 times [2025-03-17 05:59:38,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:38,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096226456] [2025-03-17 05:59:38,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:38,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:38,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:59:38,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:59:38,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:38,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:38,624 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:59:38,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:38,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096226456] [2025-03-17 05:59:38,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096226456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:38,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:38,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:59:38,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423625779] [2025-03-17 05:59:38,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:38,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:59:38,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:38,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:59:38,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:59:38,625 INFO L87 Difference]: Start difference. First operand 130 states and 181 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:59:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:38,985 INFO L93 Difference]: Finished difference Result 341 states and 474 transitions. [2025-03-17 05:59:38,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:59:38,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2025-03-17 05:59:38,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:38,988 INFO L225 Difference]: With dead ends: 341 [2025-03-17 05:59:38,988 INFO L226 Difference]: Without dead ends: 212 [2025-03-17 05:59:38,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:59:38,989 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 92 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:38,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 343 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:59:38,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-17 05:59:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2025-03-17 05:59:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 171 states have (on average 1.304093567251462) internal successors, (223), 173 states have internal predecessors, (223), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:59:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 291 transitions. [2025-03-17 05:59:39,021 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 291 transitions. Word has length 112 [2025-03-17 05:59:39,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:39,021 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 291 transitions. [2025-03-17 05:59:39,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:59:39,021 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 291 transitions. [2025-03-17 05:59:39,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:59:39,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:39,022 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:39,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:59:39,026 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:39,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:39,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1235883080, now seen corresponding path program 1 times [2025-03-17 05:59:39,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:39,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586997039] [2025-03-17 05:59:39,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:39,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:39,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:59:39,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:59:39,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:39,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:40,176 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:59:40,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:40,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586997039] [2025-03-17 05:59:40,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586997039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:40,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:40,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:59:40,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564870437] [2025-03-17 05:59:40,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:40,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:59:40,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:40,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:59:40,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:59:40,178 INFO L87 Difference]: Start difference. First operand 210 states and 291 transitions. Second operand has 9 states, 6 states have (on average 6.666666666666667) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-17 05:59:40,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:40,699 INFO L93 Difference]: Finished difference Result 458 states and 634 transitions. [2025-03-17 05:59:40,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:59:40,700 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 6.666666666666667) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) Word has length 112 [2025-03-17 05:59:40,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:40,701 INFO L225 Difference]: With dead ends: 458 [2025-03-17 05:59:40,701 INFO L226 Difference]: Without dead ends: 257 [2025-03-17 05:59:40,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:59:40,702 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 64 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:40,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 587 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:59:40,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-17 05:59:40,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 224. [2025-03-17 05:59:40,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 185 states have (on average 1.308108108108108) internal successors, (242), 187 states have internal predecessors, (242), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:59:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 310 transitions. [2025-03-17 05:59:40,725 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 310 transitions. Word has length 112 [2025-03-17 05:59:40,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:40,725 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 310 transitions. [2025-03-17 05:59:40,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 6.666666666666667) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-17 05:59:40,726 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 310 transitions. [2025-03-17 05:59:40,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:59:40,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:40,727 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:40,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:59:40,727 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:40,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:40,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1364965799, now seen corresponding path program 1 times [2025-03-17 05:59:40,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:40,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493523867] [2025-03-17 05:59:40,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:40,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:40,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:59:40,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:59:40,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:40,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:41,279 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:59:41,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:41,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493523867] [2025-03-17 05:59:41,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493523867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:41,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:41,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:59:41,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366434984] [2025-03-17 05:59:41,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:41,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:59:41,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:41,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:59:41,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:59:41,280 INFO L87 Difference]: Start difference. First operand 224 states and 310 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:59:41,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:41,590 INFO L93 Difference]: Finished difference Result 484 states and 667 transitions. [2025-03-17 05:59:41,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:59:41,591 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 112 [2025-03-17 05:59:41,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:41,592 INFO L225 Difference]: With dead ends: 484 [2025-03-17 05:59:41,592 INFO L226 Difference]: Without dead ends: 269 [2025-03-17 05:59:41,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:59:41,593 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 60 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:41,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 838 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:59:41,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-17 05:59:41,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2025-03-17 05:59:41,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 219 states have (on average 1.2968036529680365) internal successors, (284), 222 states have internal predecessors, (284), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:59:41,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 364 transitions. [2025-03-17 05:59:41,615 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 364 transitions. Word has length 112 [2025-03-17 05:59:41,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:41,616 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 364 transitions. [2025-03-17 05:59:41,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:59:41,616 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 364 transitions. [2025-03-17 05:59:41,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:59:41,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:41,618 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:41,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:59:41,618 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:41,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:41,619 INFO L85 PathProgramCache]: Analyzing trace with hash 630129703, now seen corresponding path program 1 times [2025-03-17 05:59:41,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:41,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005608263] [2025-03-17 05:59:41,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:41,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:41,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:59:41,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:59:41,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:41,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:59:41,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:41,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005608263] [2025-03-17 05:59:41,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005608263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:41,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:41,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:59:41,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874448701] [2025-03-17 05:59:41,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:41,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:59:41,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:41,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:59:41,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:59:41,918 INFO L87 Difference]: Start difference. First operand 266 states and 364 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:59:42,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:42,222 INFO L93 Difference]: Finished difference Result 516 states and 706 transitions. [2025-03-17 05:59:42,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:59:42,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 113 [2025-03-17 05:59:42,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:42,225 INFO L225 Difference]: With dead ends: 516 [2025-03-17 05:59:42,226 INFO L226 Difference]: Without dead ends: 226 [2025-03-17 05:59:42,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:59:42,227 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 91 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:42,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 269 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:59:42,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-17 05:59:42,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2025-03-17 05:59:42,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 179 states have (on average 1.2569832402234637) internal successors, (225), 181 states have internal predecessors, (225), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:59:42,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 301 transitions. [2025-03-17 05:59:42,252 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 301 transitions. Word has length 113 [2025-03-17 05:59:42,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:42,252 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 301 transitions. [2025-03-17 05:59:42,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:59:42,252 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 301 transitions. [2025-03-17 05:59:42,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:59:42,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:42,253 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:42,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:59:42,254 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:42,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:42,255 INFO L85 PathProgramCache]: Analyzing trace with hash -114718301, now seen corresponding path program 1 times [2025-03-17 05:59:42,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:42,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805394768] [2025-03-17 05:59:42,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:42,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:42,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:59:42,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:59:42,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:42,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:59:43,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:43,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805394768] [2025-03-17 05:59:43,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805394768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:43,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:43,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:59:43,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978986450] [2025-03-17 05:59:43,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:43,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:59:43,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:43,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:59:43,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:59:43,018 INFO L87 Difference]: Start difference. First operand 224 states and 301 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:59:43,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:43,405 INFO L93 Difference]: Finished difference Result 482 states and 650 transitions. [2025-03-17 05:59:43,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:59:43,406 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 113 [2025-03-17 05:59:43,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:43,407 INFO L225 Difference]: With dead ends: 482 [2025-03-17 05:59:43,407 INFO L226 Difference]: Without dead ends: 267 [2025-03-17 05:59:43,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:59:43,408 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 49 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:43,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 638 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:59:43,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-17 05:59:43,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 239. [2025-03-17 05:59:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 194 states have (on average 1.2628865979381443) internal successors, (245), 196 states have internal predecessors, (245), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:59:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 321 transitions. [2025-03-17 05:59:43,423 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 321 transitions. Word has length 113 [2025-03-17 05:59:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:43,424 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 321 transitions. [2025-03-17 05:59:43,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:59:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 321 transitions. [2025-03-17 05:59:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:59:43,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:43,425 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:43,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:59:43,425 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:43,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:43,425 INFO L85 PathProgramCache]: Analyzing trace with hash 14364418, now seen corresponding path program 1 times [2025-03-17 05:59:43,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:43,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437216746] [2025-03-17 05:59:43,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:43,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:43,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:59:43,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:59:43,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:43,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:44,170 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:59:44,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:44,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437216746] [2025-03-17 05:59:44,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437216746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:44,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:44,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:59:44,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95535803] [2025-03-17 05:59:44,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:44,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:59:44,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:44,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:59:44,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:59:44,171 INFO L87 Difference]: Start difference. First operand 239 states and 321 transitions. Second operand has 8 states, 5 states have (on average 8.2) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-17 05:59:44,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:44,539 INFO L93 Difference]: Finished difference Result 494 states and 665 transitions. [2025-03-17 05:59:44,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:59:44,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 8.2) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) Word has length 113 [2025-03-17 05:59:44,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:44,542 INFO L225 Difference]: With dead ends: 494 [2025-03-17 05:59:44,542 INFO L226 Difference]: Without dead ends: 264 [2025-03-17 05:59:44,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:59:44,543 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 43 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:44,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 568 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:59:44,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-17 05:59:44,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 239. [2025-03-17 05:59:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 194 states have (on average 1.2577319587628866) internal successors, (244), 196 states have internal predecessors, (244), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:59:44,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 320 transitions. [2025-03-17 05:59:44,558 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 320 transitions. Word has length 113 [2025-03-17 05:59:44,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:44,558 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 320 transitions. [2025-03-17 05:59:44,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 8.2) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-17 05:59:44,559 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 320 transitions. [2025-03-17 05:59:44,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:59:44,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:44,559 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:44,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:59:44,560 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:44,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:44,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1111790654, now seen corresponding path program 1 times [2025-03-17 05:59:44,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:44,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484715612] [2025-03-17 05:59:44,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:44,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:44,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:59:44,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:59:44,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:44,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:59:45,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:45,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484715612] [2025-03-17 05:59:45,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484715612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:45,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:45,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:59:45,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804908741] [2025-03-17 05:59:45,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:45,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:59:45,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:45,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:59:45,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:59:45,201 INFO L87 Difference]: Start difference. First operand 239 states and 320 transitions. Second operand has 8 states, 6 states have (on average 6.833333333333333) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 05:59:45,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:45,596 INFO L93 Difference]: Finished difference Result 494 states and 663 transitions. [2025-03-17 05:59:45,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:59:45,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 6.833333333333333) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 113 [2025-03-17 05:59:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:45,598 INFO L225 Difference]: With dead ends: 494 [2025-03-17 05:59:45,598 INFO L226 Difference]: Without dead ends: 264 [2025-03-17 05:59:45,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:59:45,599 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 44 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:45,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 505 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:59:45,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-17 05:59:45,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 239. [2025-03-17 05:59:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 194 states have (on average 1.2525773195876289) internal successors, (243), 196 states have internal predecessors, (243), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:59:45,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 319 transitions. [2025-03-17 05:59:45,621 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 319 transitions. Word has length 113 [2025-03-17 05:59:45,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:45,621 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 319 transitions. [2025-03-17 05:59:45,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 6.833333333333333) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 05:59:45,621 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 319 transitions. [2025-03-17 05:59:45,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:59:45,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:45,622 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:45,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:59:45,622 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:45,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:45,623 INFO L85 PathProgramCache]: Analyzing trace with hash -982707935, now seen corresponding path program 1 times [2025-03-17 05:59:45,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:45,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791116282] [2025-03-17 05:59:45,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:45,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:45,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:59:45,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:59:45,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:45,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:59:46,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:46,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791116282] [2025-03-17 05:59:46,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791116282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:46,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:46,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:59:46,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733897339] [2025-03-17 05:59:46,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:46,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:59:46,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:46,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:59:46,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:59:46,199 INFO L87 Difference]: Start difference. First operand 239 states and 319 transitions. Second operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:59:46,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:46,804 INFO L93 Difference]: Finished difference Result 502 states and 670 transitions. [2025-03-17 05:59:46,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:59:46,805 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 113 [2025-03-17 05:59:46,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:46,807 INFO L225 Difference]: With dead ends: 502 [2025-03-17 05:59:46,807 INFO L226 Difference]: Without dead ends: 272 [2025-03-17 05:59:46,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:59:46,809 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 51 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:46,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1232 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:59:46,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-17 05:59:46,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 261. [2025-03-17 05:59:46,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 216 states have (on average 1.2638888888888888) internal successors, (273), 218 states have internal predecessors, (273), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:59:46,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 349 transitions. [2025-03-17 05:59:46,832 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 349 transitions. Word has length 113 [2025-03-17 05:59:46,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:46,833 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 349 transitions. [2025-03-17 05:59:46,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:59:46,833 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 349 transitions. [2025-03-17 05:59:46,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:59:46,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:46,835 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:46,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:59:46,835 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:46,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:46,836 INFO L85 PathProgramCache]: Analyzing trace with hash 553063124, now seen corresponding path program 1 times [2025-03-17 05:59:46,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:46,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143266948] [2025-03-17 05:59:46,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:46,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:46,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:59:46,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:59:46,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:46,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:59:47,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:47,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143266948] [2025-03-17 05:59:47,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143266948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:47,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:47,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:59:47,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308595477] [2025-03-17 05:59:47,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:47,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:59:47,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:47,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:59:47,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:59:47,486 INFO L87 Difference]: Start difference. First operand 261 states and 349 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:59:47,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:47,793 INFO L93 Difference]: Finished difference Result 682 states and 901 transitions. [2025-03-17 05:59:47,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:59:47,794 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2025-03-17 05:59:47,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:47,796 INFO L225 Difference]: With dead ends: 682 [2025-03-17 05:59:47,796 INFO L226 Difference]: Without dead ends: 422 [2025-03-17 05:59:47,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:59:47,797 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 46 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:47,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 633 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:59:47,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-17 05:59:47,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 294. [2025-03-17 05:59:47,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 249 states have (on average 1.2409638554216869) internal successors, (309), 251 states have internal predecessors, (309), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:59:47,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2025-03-17 05:59:47,820 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 114 [2025-03-17 05:59:47,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:47,821 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2025-03-17 05:59:47,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:59:47,821 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2025-03-17 05:59:47,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:59:47,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:47,823 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:47,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:59:47,824 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:47,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:47,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1234725459, now seen corresponding path program 1 times [2025-03-17 05:59:47,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:47,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138530214] [2025-03-17 05:59:47,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:47,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:47,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:59:47,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:59:47,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:47,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:49,711 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 05:59:49,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:49,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138530214] [2025-03-17 05:59:49,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138530214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:59:49,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094095208] [2025-03-17 05:59:49,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:49,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:49,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:49,714 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:59:49,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:59:49,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:59:50,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:59:50,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:50,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:50,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-17 05:59:50,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:59:50,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 05:59:50,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2025-03-17 05:59:50,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:50,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 43 [2025-03-17 05:59:50,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:50,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 43 [2025-03-17 05:59:50,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:50,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 56 [2025-03-17 05:59:51,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:51,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 56 [2025-03-17 05:59:51,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:51,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 92 treesize of output 83 [2025-03-17 05:59:51,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 104 [2025-03-17 05:59:51,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:51,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 129 treesize of output 119 [2025-03-17 05:59:54,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:54,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 199 treesize of output 156 [2025-03-17 06:00:00,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:00,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 202 treesize of output 72 [2025-03-17 06:00:01,231 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 250 proven. 99 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-17 06:00:01,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:00:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:00:02,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094095208] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:00:02,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:00:02,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15, 29] total 44 [2025-03-17 06:00:02,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638825056] [2025-03-17 06:00:02,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:02,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:00:02,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:02,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:00:02,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1660, Unknown=0, NotChecked=0, Total=1892 [2025-03-17 06:00:02,371 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:00:03,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:03,310 INFO L93 Difference]: Finished difference Result 694 states and 901 transitions. [2025-03-17 06:00:03,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:00:03,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 115 [2025-03-17 06:00:03,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:03,314 INFO L225 Difference]: With dead ends: 694 [2025-03-17 06:00:03,315 INFO L226 Difference]: Without dead ends: 401 [2025-03-17 06:00:03,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 209 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=253, Invalid=1817, Unknown=0, NotChecked=0, Total=2070 [2025-03-17 06:00:03,317 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 158 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:03,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 379 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:00:03,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-17 06:00:03,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 265. [2025-03-17 06:00:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 222 states have (on average 1.2207207207207207) internal successors, (271), 223 states have internal predecessors, (271), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 06:00:03,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 343 transitions. [2025-03-17 06:00:03,336 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 343 transitions. Word has length 115 [2025-03-17 06:00:03,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:03,336 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 343 transitions. [2025-03-17 06:00:03,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:00:03,336 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 343 transitions. [2025-03-17 06:00:03,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 06:00:03,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:03,338 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:03,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 06:00:03,539 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,SelfDestructingSolverStorable13 [2025-03-17 06:00:03,539 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:03,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:03,540 INFO L85 PathProgramCache]: Analyzing trace with hash -554735889, now seen corresponding path program 1 times [2025-03-17 06:00:03,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:03,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114360414] [2025-03-17 06:00:03,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:03,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:03,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 06:00:03,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 06:00:03,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:03,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:00:05,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:05,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114360414] [2025-03-17 06:00:05,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114360414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:05,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:05,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:00:05,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992798211] [2025-03-17 06:00:05,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:05,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:00:05,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:05,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:00:05,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:00:05,747 INFO L87 Difference]: Start difference. First operand 265 states and 343 transitions. Second operand has 10 states, 7 states have (on average 6.285714285714286) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-17 06:00:06,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:06,710 INFO L93 Difference]: Finished difference Result 621 states and 803 transitions. [2025-03-17 06:00:06,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:00:06,711 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 6.285714285714286) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) Word has length 116 [2025-03-17 06:00:06,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:06,713 INFO L225 Difference]: With dead ends: 621 [2025-03-17 06:00:06,713 INFO L226 Difference]: Without dead ends: 357 [2025-03-17 06:00:06,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:00:06,714 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 50 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:06,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 656 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 06:00:06,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-17 06:00:06,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 265. [2025-03-17 06:00:06,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 222 states have (on average 1.2162162162162162) internal successors, (270), 223 states have internal predecessors, (270), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 06:00:06,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 342 transitions. [2025-03-17 06:00:06,737 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 342 transitions. Word has length 116 [2025-03-17 06:00:06,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:06,738 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 342 transitions. [2025-03-17 06:00:06,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 6.285714285714286) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-17 06:00:06,738 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 342 transitions. [2025-03-17 06:00:06,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 06:00:06,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:06,739 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:06,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 06:00:06,739 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:06,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:06,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1780566161, now seen corresponding path program 1 times [2025-03-17 06:00:06,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:06,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124936255] [2025-03-17 06:00:06,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:06,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:06,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 06:00:06,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 06:00:06,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:06,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:00:07,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:07,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124936255] [2025-03-17 06:00:07,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124936255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:07,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:07,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:00:07,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562013452] [2025-03-17 06:00:07,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:07,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:00:07,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:07,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:00:07,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:00:07,335 INFO L87 Difference]: Start difference. First operand 265 states and 342 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:00:07,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:07,620 INFO L93 Difference]: Finished difference Result 301 states and 383 transitions. [2025-03-17 06:00:07,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:00:07,621 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2025-03-17 06:00:07,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:07,622 INFO L225 Difference]: With dead ends: 301 [2025-03-17 06:00:07,623 INFO L226 Difference]: Without dead ends: 299 [2025-03-17 06:00:07,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:00:07,623 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 60 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:07,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 442 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:00:07,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-17 06:00:07,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 243. [2025-03-17 06:00:07,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 199 states have (on average 1.1959798994974875) internal successors, (238), 200 states have internal predecessors, (238), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 06:00:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 310 transitions. [2025-03-17 06:00:07,645 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 310 transitions. Word has length 116 [2025-03-17 06:00:07,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:07,646 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 310 transitions. [2025-03-17 06:00:07,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:00:07,647 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 310 transitions. [2025-03-17 06:00:07,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 06:00:07,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:07,647 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:07,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 06:00:07,648 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:07,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:07,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1781489682, now seen corresponding path program 1 times [2025-03-17 06:00:07,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:07,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453899032] [2025-03-17 06:00:07,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:07,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:07,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 06:00:07,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 06:00:07,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:07,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat