./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-array/btor2c-lazyMod.safe_linked_list_fifo_n2d4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-array/btor2c-lazyMod.safe_linked_list_fifo_n2d4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash a7b742cc0d0eaef445a8f90399cbd092d4cb10efae03dcad0c8e37a0643e7fd6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:30:46,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:30:46,136 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 16:30:46,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:30:46,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:30:46,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:30:46,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:30:46,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:30:46,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:30:46,161 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:30:46,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:30:46,162 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:30:46,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:30:46,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:30:46,162 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:30:46,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:30:46,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:30:46,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:30:46,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:30:46,163 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:30:46,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:30:46,163 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:30:46,163 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:30:46,163 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:30:46,163 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:30:46,163 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:30:46,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:30:46,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:30:46,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:30:46,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:30:46,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:30:46,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:30:46,164 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:30:46,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:30:46,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:30:46,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:30:46,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:30:46,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:30:46,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:30:46,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:30:46,165 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7b742cc0d0eaef445a8f90399cbd092d4cb10efae03dcad0c8e37a0643e7fd6 [2025-03-03 16:30:46,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:30:46,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:30:46,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:30:46,402 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:30:46,403 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:30:46,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-array/btor2c-lazyMod.safe_linked_list_fifo_n2d4.c [2025-03-03 16:30:47,607 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a95b46488/76cd595638bc471f9595050c3e6d0c3b/FLAG4e64cbdf0 [2025-03-03 16:30:47,928 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:30:47,930 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-array/btor2c-lazyMod.safe_linked_list_fifo_n2d4.c [2025-03-03 16:30:47,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a95b46488/76cd595638bc471f9595050c3e6d0c3b/FLAG4e64cbdf0 [2025-03-03 16:30:47,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a95b46488/76cd595638bc471f9595050c3e6d0c3b [2025-03-03 16:30:47,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:30:47,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:30:47,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:30:47,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:30:47,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:30:47,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:30:47" (1/1) ... [2025-03-03 16:30:47,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f326f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:47, skipping insertion in model container [2025-03-03 16:30:47,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:30:47" (1/1) ... [2025-03-03 16:30:48,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:30:48,118 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/hardware-verification-array/btor2c-lazyMod.safe_linked_list_fifo_n2d4.c[1266,1279] [2025-03-03 16:30:48,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:30:48,320 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:30:48,327 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/hardware-verification-array/btor2c-lazyMod.safe_linked_list_fifo_n2d4.c[1266,1279] [2025-03-03 16:30:48,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:30:48,432 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:30:48,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:48 WrapperNode [2025-03-03 16:30:48,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:30:48,434 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:30:48,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:30:48,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:30:48,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:48" (1/1) ... [2025-03-03 16:30:48,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:48" (1/1) ... [2025-03-03 16:30:48,767 INFO L138 Inliner]: procedures = 18, calls = 107, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3678 [2025-03-03 16:30:48,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:30:48,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:30:48,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:30:48,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:30:48,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:48" (1/1) ... [2025-03-03 16:30:48,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:48" (1/1) ... [2025-03-03 16:30:48,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:48" (1/1) ... [2025-03-03 16:30:48,950 INFO L175 MemorySlicer]: Split 63 memory accesses to 4 slices as follows [29, 2, 24, 8]. 46 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0, 0]. The 30 writes are split as follows [14, 0, 12, 4]. [2025-03-03 16:30:48,951 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:48" (1/1) ... [2025-03-03 16:30:48,951 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:48" (1/1) ... [2025-03-03 16:30:49,037 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:48" (1/1) ... [2025-03-03 16:30:49,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:48" (1/1) ... [2025-03-03 16:30:49,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:48" (1/1) ... [2025-03-03 16:30:49,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:48" (1/1) ... [2025-03-03 16:30:49,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:30:49,179 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:30:49,179 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:30:49,179 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:30:49,180 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:48" (1/1) ... [2025-03-03 16:30:49,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:30:49,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:30:49,230 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-03 16:30:49,233 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-03 16:30:49,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:30:49,263 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 16:30:49,263 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 16:30:49,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:30:49,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 16:30:49,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 16:30:49,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 16:30:49,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 16:30:49,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 16:30:49,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 16:30:49,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 16:30:49,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 16:30:49,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:30:49,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:30:49,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 16:30:49,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 16:30:49,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 16:30:49,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 16:30:49,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 16:30:49,557 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:30:49,558 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:30:51,674 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L144: call ULTIMATE.dealloc(main_~#state_13~0#1.base, main_~#state_13~0#1.offset);havoc main_~#state_13~0#1.base, main_~#state_13~0#1.offset;call ULTIMATE.dealloc(main_~#state_15~0#1.base, main_~#state_15~0#1.offset);havoc main_~#state_15~0#1.base, main_~#state_15~0#1.offset;call ULTIMATE.dealloc(main_~#state_249~0#1.base, main_~#state_249~0#1.offset);havoc main_~#state_249~0#1.base, main_~#state_249~0#1.offset; [2025-03-03 16:30:52,099 INFO L? ?]: Removed 1891 outVars from TransFormulas that were not future-live. [2025-03-03 16:30:52,099 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:30:52,222 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:30:52,227 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:30:52,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:30:52 BoogieIcfgContainer [2025-03-03 16:30:52,227 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:30:52,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:30:52,229 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:30:52,232 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:30:52,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:30:47" (1/3) ... [2025-03-03 16:30:52,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba9874c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:30:52, skipping insertion in model container [2025-03-03 16:30:52,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:48" (2/3) ... [2025-03-03 16:30:52,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba9874c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:30:52, skipping insertion in model container [2025-03-03 16:30:52,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:30:52" (3/3) ... [2025-03-03 16:30:52,236 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.safe_linked_list_fifo_n2d4.c [2025-03-03 16:30:52,248 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:30:52,250 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.safe_linked_list_fifo_n2d4.c that has 2 procedures, 1113 locations, 1 initial locations, 19 loop locations, and 1 error locations. [2025-03-03 16:30:52,313 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:30:52,320 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;@7ebe8589, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:30:52,321 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 16:30:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 1113 states, 1105 states have (on average 1.5040723981900452) internal successors, (1662), 1106 states have internal predecessors, (1662), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 16:30:52,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-03-03 16:30:52,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:30:52,342 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:30:52,342 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:30:52,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:30:52,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1130841553, now seen corresponding path program 1 times [2025-03-03 16:30:52,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:30:52,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762640415] [2025-03-03 16:30:52,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:30:52,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:30:52,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-03 16:30:52,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-03 16:30:52,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:30:52,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:30:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 16:30:52,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:30:52,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762640415] [2025-03-03 16:30:52,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762640415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:30:52,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078372740] [2025-03-03 16:30:52,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:30:52,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:30:52,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:30:52,890 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-03 16:30:52,891 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-03 16:30:53,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-03 16:30:53,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-03 16:30:53,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:30:53,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:30:53,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 16:30:53,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:30:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 16:30:53,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:30:53,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078372740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:30:53,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:30:53,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 16:30:53,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896351671] [2025-03-03 16:30:53,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:30:53,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 16:30:53,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:30:53,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 16:30:53,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:30:53,540 INFO L87 Difference]: Start difference. First operand has 1113 states, 1105 states have (on average 1.5040723981900452) internal successors, (1662), 1106 states have internal predecessors, (1662), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 156.0) internal successors, (312), 2 states have internal predecessors, (312), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:30:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:30:53,850 INFO L93 Difference]: Finished difference Result 1774 states and 2673 transitions. [2025-03-03 16:30:53,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 16:30:53,852 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 156.0) internal successors, (312), 2 states have internal predecessors, (312), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 332 [2025-03-03 16:30:53,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:30:53,868 INFO L225 Difference]: With dead ends: 1774 [2025-03-03 16:30:53,869 INFO L226 Difference]: Without dead ends: 1110 [2025-03-03 16:30:53,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 333 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-03 16:30:53,876 INFO L435 NwaCegarLoop]: 1399 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:30:53,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1399 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:30:53,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2025-03-03 16:30:53,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2025-03-03 16:30:53,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1103 states have (on average 1.5022665457842248) internal successors, (1657), 1103 states have internal predecessors, (1657), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 16:30:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1667 transitions. [2025-03-03 16:30:53,938 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1667 transitions. Word has length 332 [2025-03-03 16:30:53,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:30:53,939 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1667 transitions. [2025-03-03 16:30:53,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 156.0) internal successors, (312), 2 states have internal predecessors, (312), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:30:53,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1667 transitions. [2025-03-03 16:30:53,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-03-03 16:30:53,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:30:53,946 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:30:53,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 16:30:54,147 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-03 16:30:54,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:30:54,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:30:54,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1352756150, now seen corresponding path program 1 times [2025-03-03 16:30:54,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:30:54,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386130279] [2025-03-03 16:30:54,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:30:54,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:30:54,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-03 16:30:54,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-03 16:30:54,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:30:54,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:30:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 16:30:54,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:30:54,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386130279] [2025-03-03 16:30:54,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386130279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:30:54,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:30:54,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:30:54,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044449848] [2025-03-03 16:30:54,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:30:54,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:30:54,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:30:54,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:30:54,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:30:54,685 INFO L87 Difference]: Start difference. First operand 1110 states and 1667 transitions. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:30:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:30:55,016 INFO L93 Difference]: Finished difference Result 2218 states and 3332 transitions. [2025-03-03 16:30:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:30:55,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 332 [2025-03-03 16:30:55,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:30:55,021 INFO L225 Difference]: With dead ends: 2218 [2025-03-03 16:30:55,021 INFO L226 Difference]: Without dead ends: 1115 [2025-03-03 16:30:55,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:30:55,023 INFO L435 NwaCegarLoop]: 1397 mSDtfsCounter, 6 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:30:55,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2792 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:30:55,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-03-03 16:30:55,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1111. [2025-03-03 16:30:55,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1104 states have (on average 1.5018115942028984) internal successors, (1658), 1104 states have internal predecessors, (1658), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 16:30:55,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1668 transitions. [2025-03-03 16:30:55,043 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1668 transitions. Word has length 332 [2025-03-03 16:30:55,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:30:55,043 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1668 transitions. [2025-03-03 16:30:55,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:30:55,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1668 transitions. [2025-03-03 16:30:55,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-03-03 16:30:55,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:30:55,047 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:30:55,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:30:55,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:30:55,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:30:55,048 INFO L85 PathProgramCache]: Analyzing trace with hash 122763062, now seen corresponding path program 1 times [2025-03-03 16:30:55,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:30:55,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232009732] [2025-03-03 16:30:55,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:30:55,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:30:55,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-03 16:30:55,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-03 16:30:55,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:30:55,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:30:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 16:30:55,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:30:55,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232009732] [2025-03-03 16:30:55,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232009732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:30:55,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193551415] [2025-03-03 16:30:55,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:30:55,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:30:55,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:30:55,544 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-03 16:30:55,545 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-03 16:30:55,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-03 16:30:55,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-03 16:30:55,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:30:55,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:30:55,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 1272 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 16:30:55,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:30:56,015 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 16:30:56,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:30:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:30:56,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193551415] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:30:56,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:30:56,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2025-03-03 16:30:56,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177916600] [2025-03-03 16:30:56,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:30:56,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:30:56,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:30:56,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:30:56,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:30:56,099 INFO L87 Difference]: Start difference. First operand 1111 states and 1668 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:30:56,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:30:56,595 INFO L93 Difference]: Finished difference Result 2037 states and 3059 transitions. [2025-03-03 16:30:56,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:30:56,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 335 [2025-03-03 16:30:56,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:30:56,599 INFO L225 Difference]: With dead ends: 2037 [2025-03-03 16:30:56,599 INFO L226 Difference]: Without dead ends: 1112 [2025-03-03 16:30:56,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:30:56,601 INFO L435 NwaCegarLoop]: 1397 mSDtfsCounter, 6 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2787 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:30:56,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2787 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:30:56,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2025-03-03 16:30:56,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1112. [2025-03-03 16:30:56,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 1105 states have (on average 1.5013574660633484) internal successors, (1659), 1105 states have internal predecessors, (1659), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 16:30:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1669 transitions. [2025-03-03 16:30:56,618 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1669 transitions. Word has length 335 [2025-03-03 16:30:56,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:30:56,618 INFO L471 AbstractCegarLoop]: Abstraction has 1112 states and 1669 transitions. [2025-03-03 16:30:56,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:30:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1669 transitions. [2025-03-03 16:30:56,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-03 16:30:56,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:30:56,622 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:30:56,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 16:30:56,826 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,SelfDestructingSolverStorable2 [2025-03-03 16:30:56,826 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:30:56,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:30:56,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1843538136, now seen corresponding path program 1 times [2025-03-03 16:30:56,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:30:56,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505685326] [2025-03-03 16:30:56,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:30:56,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:30:56,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-03 16:30:56,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-03 16:30:56,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:30:56,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:30:57,194 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:30:57,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:30:57,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505685326] [2025-03-03 16:30:57,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505685326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:30:57,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725676040] [2025-03-03 16:30:57,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:30:57,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:30:57,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:30:57,198 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:30:57,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 16:30:57,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-03 16:30:57,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-03 16:30:57,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:30:57,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:30:57,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-03 16:30:57,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:30:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:30:57,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:30:58,990 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 16:30:58,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725676040] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:30:58,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:30:58,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4, 4] total 13 [2025-03-03 16:30:58,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556325262] [2025-03-03 16:30:58,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:30:58,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:30:58,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:30:58,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:30:58,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:30:58,992 INFO L87 Difference]: Start difference. First operand 1112 states and 1669 transitions. Second operand has 9 states, 9 states have (on average 35.111111111111114) internal successors, (316), 9 states have internal predecessors, (316), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:31:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:01,631 INFO L93 Difference]: Finished difference Result 2506 states and 3764 transitions. [2025-03-03 16:31:01,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 16:31:01,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 35.111111111111114) internal successors, (316), 9 states have internal predecessors, (316), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 338 [2025-03-03 16:31:01,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:01,639 INFO L225 Difference]: With dead ends: 2506 [2025-03-03 16:31:01,639 INFO L226 Difference]: Without dead ends: 1845 [2025-03-03 16:31:01,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 16:31:01,642 INFO L435 NwaCegarLoop]: 1443 mSDtfsCounter, 7101 mSDsluCounter, 4108 mSDsCounter, 0 mSdLazyCounter, 3443 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7106 SdHoareTripleChecker+Valid, 5551 SdHoareTripleChecker+Invalid, 3594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 3443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:01,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7106 Valid, 5551 Invalid, 3594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 3443 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 16:31:01,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2025-03-03 16:31:01,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1210. [2025-03-03 16:31:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 1199 states have (on average 1.4987489574645538) internal successors, (1797), 1199 states have internal predecessors, (1797), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 16:31:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1815 transitions. [2025-03-03 16:31:01,674 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1815 transitions. Word has length 338 [2025-03-03 16:31:01,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:01,674 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 1815 transitions. [2025-03-03 16:31:01,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 35.111111111111114) internal successors, (316), 9 states have internal predecessors, (316), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:31:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1815 transitions. [2025-03-03 16:31:01,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-03 16:31:01,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:01,679 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:31:01,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 16:31:01,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:01,885 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:01,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:01,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1515611073, now seen corresponding path program 1 times [2025-03-03 16:31:01,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:01,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730475185] [2025-03-03 16:31:01,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:01,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:01,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-03 16:31:01,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-03 16:31:01,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:01,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:31:02,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:02,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730475185] [2025-03-03 16:31:02,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730475185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:02,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248244012] [2025-03-03 16:31:02,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:02,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:02,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:02,212 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:02,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 16:31:02,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-03 16:31:02,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-03 16:31:02,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:02,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:02,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 16:31:02,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:02,690 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:31:02,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:03,199 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 16:31:03,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248244012] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:03,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:03,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 4] total 12 [2025-03-03 16:31:03,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214826930] [2025-03-03 16:31:03,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:03,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:31:03,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:03,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:31:03,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-03 16:31:03,201 INFO L87 Difference]: Start difference. First operand 1210 states and 1815 transitions. Second operand has 8 states, 8 states have (on average 39.625) internal successors, (317), 8 states have internal predecessors, (317), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:31:03,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:03,597 INFO L93 Difference]: Finished difference Result 1967 states and 2951 transitions. [2025-03-03 16:31:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:31:03,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 39.625) internal successors, (317), 8 states have internal predecessors, (317), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 339 [2025-03-03 16:31:03,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:03,602 INFO L225 Difference]: With dead ends: 1967 [2025-03-03 16:31:03,602 INFO L226 Difference]: Without dead ends: 1210 [2025-03-03 16:31:03,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 670 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:31:03,604 INFO L435 NwaCegarLoop]: 1377 mSDtfsCounter, 1380 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 2797 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:03,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 2797 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:31:03,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2025-03-03 16:31:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1210. [2025-03-03 16:31:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 1199 states have (on average 1.4979149291075897) internal successors, (1796), 1199 states have internal predecessors, (1796), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 16:31:03,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1814 transitions. [2025-03-03 16:31:03,631 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1814 transitions. Word has length 339 [2025-03-03 16:31:03,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:03,631 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 1814 transitions. [2025-03-03 16:31:03,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 39.625) internal successors, (317), 8 states have internal predecessors, (317), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:31:03,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1814 transitions. [2025-03-03 16:31:03,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-03 16:31:03,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:03,635 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:31:03,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 16:31:03,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:03,836 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:03,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:03,836 INFO L85 PathProgramCache]: Analyzing trace with hash -981752993, now seen corresponding path program 1 times [2025-03-03 16:31:03,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:03,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167392302] [2025-03-03 16:31:03,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:03,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:03,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-03 16:31:03,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-03 16:31:03,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:03,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:04,123 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:31:04,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:04,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167392302] [2025-03-03 16:31:04,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167392302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:04,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707626477] [2025-03-03 16:31:04,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:04,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:04,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:04,126 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:04,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 16:31:04,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-03 16:31:04,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-03 16:31:04,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:04,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:04,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 16:31:04,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:04,788 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:31:04,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:05,492 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 16:31:05,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707626477] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:05,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:05,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 9 [2025-03-03 16:31:05,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020825376] [2025-03-03 16:31:05,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:05,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:31:05,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:05,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:31:05,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:31:05,494 INFO L87 Difference]: Start difference. First operand 1210 states and 1814 transitions. Second operand has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:06,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:06,306 INFO L93 Difference]: Finished difference Result 1967 states and 2949 transitions. [2025-03-03 16:31:06,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:31:06,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 339 [2025-03-03 16:31:06,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:06,310 INFO L225 Difference]: With dead ends: 1967 [2025-03-03 16:31:06,310 INFO L226 Difference]: Without dead ends: 1210 [2025-03-03 16:31:06,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 673 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:31:06,311 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 1416 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:06,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1421 Valid, 1715 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1621 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 16:31:06,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2025-03-03 16:31:06,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1210. [2025-03-03 16:31:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 1199 states have (on average 1.4970809007506256) internal successors, (1795), 1199 states have internal predecessors, (1795), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 16:31:06,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1813 transitions. [2025-03-03 16:31:06,349 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1813 transitions. Word has length 339 [2025-03-03 16:31:06,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:06,350 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 1813 transitions. [2025-03-03 16:31:06,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:06,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1813 transitions. [2025-03-03 16:31:06,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-03 16:31:06,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:06,354 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:31:06,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 16:31:06,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:06,555 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:06,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:06,555 INFO L85 PathProgramCache]: Analyzing trace with hash 245882909, now seen corresponding path program 1 times [2025-03-03 16:31:06,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:06,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891130093] [2025-03-03 16:31:06,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:06,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:06,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-03 16:31:06,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-03 16:31:06,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:06,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:06,795 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:31:06,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:06,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891130093] [2025-03-03 16:31:06,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891130093] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:06,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359841689] [2025-03-03 16:31:06,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:06,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:06,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:06,798 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:06,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 16:31:07,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-03 16:31:07,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-03 16:31:07,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:07,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:07,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 1286 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 16:31:07,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:07,319 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:31:07,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:07,835 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:31:07,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359841689] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:31:07,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:31:07,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 8] total 12 [2025-03-03 16:31:07,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256819447] [2025-03-03 16:31:07,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:31:07,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 16:31:07,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:07,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 16:31:07,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-03 16:31:07,839 INFO L87 Difference]: Start difference. First operand 1210 states and 1813 transitions. Second operand has 12 states, 12 states have (on average 49.0) internal successors, (588), 12 states have internal predecessors, (588), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 16:31:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:09,869 INFO L93 Difference]: Finished difference Result 3145 states and 4715 transitions. [2025-03-03 16:31:09,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:31:09,870 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 49.0) internal successors, (588), 12 states have internal predecessors, (588), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 340 [2025-03-03 16:31:09,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:09,875 INFO L225 Difference]: With dead ends: 3145 [2025-03-03 16:31:09,875 INFO L226 Difference]: Without dead ends: 1943 [2025-03-03 16:31:09,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 672 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:31:09,877 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 5631 mSDsluCounter, 5024 mSDsCounter, 0 mSdLazyCounter, 5776 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5639 SdHoareTripleChecker+Valid, 5874 SdHoareTripleChecker+Invalid, 5788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 5776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:09,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5639 Valid, 5874 Invalid, 5788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 5776 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 16:31:09,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2025-03-03 16:31:09,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1315. [2025-03-03 16:31:09,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 1300 states have (on average 1.493076923076923) internal successors, (1941), 1300 states have internal predecessors, (1941), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 16:31:09,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1967 transitions. [2025-03-03 16:31:09,902 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1967 transitions. Word has length 340 [2025-03-03 16:31:09,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:09,902 INFO L471 AbstractCegarLoop]: Abstraction has 1315 states and 1967 transitions. [2025-03-03 16:31:09,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 49.0) internal successors, (588), 12 states have internal predecessors, (588), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 16:31:09,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1967 transitions. [2025-03-03 16:31:09,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-03-03 16:31:09,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:09,905 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:31:09,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 16:31:10,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:10,106 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:10,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:10,106 INFO L85 PathProgramCache]: Analyzing trace with hash 2101900141, now seen corresponding path program 1 times [2025-03-03 16:31:10,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:10,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733885769] [2025-03-03 16:31:10,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:10,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:10,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-03 16:31:10,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-03 16:31:10,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:10,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:31:10,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:10,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733885769] [2025-03-03 16:31:10,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733885769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:10,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625752027] [2025-03-03 16:31:10,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:10,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:10,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:10,390 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:10,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 16:31:10,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-03 16:31:10,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-03 16:31:10,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:10,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:10,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 1299 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 16:31:10,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:10,917 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 16:31:10,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-03 16:31:10,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625752027] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:31:10,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:31:10,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 4] total 9 [2025-03-03 16:31:10,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291637117] [2025-03-03 16:31:10,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:31:10,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:31:10,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:10,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:31:10,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:31:10,954 INFO L87 Difference]: Start difference. First operand 1315 states and 1967 transitions. Second operand has 9 states, 9 states have (on average 47.22222222222222) internal successors, (425), 9 states have internal predecessors, (425), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 16:31:11,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:11,545 INFO L93 Difference]: Finished difference Result 2641 states and 3954 transitions. [2025-03-03 16:31:11,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:31:11,545 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 47.22222222222222) internal successors, (425), 9 states have internal predecessors, (425), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 344 [2025-03-03 16:31:11,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:11,549 INFO L225 Difference]: With dead ends: 2641 [2025-03-03 16:31:11,549 INFO L226 Difference]: Without dead ends: 1339 [2025-03-03 16:31:11,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 684 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:31:11,551 INFO L435 NwaCegarLoop]: 1401 mSDtfsCounter, 44 mSDsluCounter, 8367 mSDsCounter, 0 mSdLazyCounter, 1942 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 9768 SdHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:11,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 9768 Invalid, 1944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1942 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:31:11,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2025-03-03 16:31:11,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1335. [2025-03-03 16:31:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 1320 states have (on average 1.4916666666666667) internal successors, (1969), 1320 states have internal predecessors, (1969), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 16:31:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1995 transitions. [2025-03-03 16:31:11,574 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1995 transitions. Word has length 344 [2025-03-03 16:31:11,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:11,574 INFO L471 AbstractCegarLoop]: Abstraction has 1335 states and 1995 transitions. [2025-03-03 16:31:11,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 47.22222222222222) internal successors, (425), 9 states have internal predecessors, (425), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 16:31:11,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1995 transitions. [2025-03-03 16:31:11,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-03 16:31:11,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:11,578 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:31:11,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 16:31:11,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:11,779 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:11,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:11,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1456109755, now seen corresponding path program 2 times [2025-03-03 16:31:11,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:11,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308108417] [2025-03-03 16:31:11,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 16:31:11,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:11,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 356 statements into 2 equivalence classes. [2025-03-03 16:31:11,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 278 of 356 statements. [2025-03-03 16:31:11,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 16:31:11,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 16:31:12,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:12,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308108417] [2025-03-03 16:31:12,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308108417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:31:12,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:31:12,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:31:12,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720634214] [2025-03-03 16:31:12,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:12,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:31:12,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:12,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:31:12,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:31:12,103 INFO L87 Difference]: Start difference. First operand 1335 states and 1995 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:12,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:12,383 INFO L93 Difference]: Finished difference Result 2652 states and 3965 transitions. [2025-03-03 16:31:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:31:12,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 356 [2025-03-03 16:31:12,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:12,386 INFO L225 Difference]: With dead ends: 2652 [2025-03-03 16:31:12,386 INFO L226 Difference]: Without dead ends: 1340 [2025-03-03 16:31:12,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:31:12,388 INFO L435 NwaCegarLoop]: 1395 mSDtfsCounter, 6 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2787 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:12,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2787 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:31:12,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2025-03-03 16:31:12,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1336. [2025-03-03 16:31:12,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1321 states have (on average 1.4912944738834217) internal successors, (1970), 1321 states have internal predecessors, (1970), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 16:31:12,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1996 transitions. [2025-03-03 16:31:12,409 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1996 transitions. Word has length 356 [2025-03-03 16:31:12,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:12,409 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 1996 transitions. [2025-03-03 16:31:12,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:12,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1996 transitions. [2025-03-03 16:31:12,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-03-03 16:31:12,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:12,412 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:31:12,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:31:12,412 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:12,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:12,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1279418732, now seen corresponding path program 1 times [2025-03-03 16:31:12,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:12,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90742208] [2025-03-03 16:31:12,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:12,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:12,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-03-03 16:31:12,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-03-03 16:31:12,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:12,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-03 16:31:12,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:12,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90742208] [2025-03-03 16:31:12,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90742208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:12,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816292577] [2025-03-03 16:31:12,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:12,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:12,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:12,691 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:12,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 16:31:13,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-03-03 16:31:13,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-03-03 16:31:13,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:13,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:13,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 16:31:13,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-03 16:31:13,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:31:13,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816292577] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:31:13,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:31:13,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 10] total 15 [2025-03-03 16:31:13,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865690627] [2025-03-03 16:31:13,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:31:13,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 16:31:13,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:13,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 16:31:13,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-03 16:31:13,314 INFO L87 Difference]: Start difference. First operand 1336 states and 1996 transitions. Second operand has 15 states, 15 states have (on average 23.666666666666668) internal successors, (355), 15 states have internal predecessors, (355), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 16:31:14,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:14,401 INFO L93 Difference]: Finished difference Result 2663 states and 3981 transitions. [2025-03-03 16:31:14,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:31:14,402 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 23.666666666666668) internal successors, (355), 15 states have internal predecessors, (355), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 359 [2025-03-03 16:31:14,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:14,405 INFO L225 Difference]: With dead ends: 2663 [2025-03-03 16:31:14,405 INFO L226 Difference]: Without dead ends: 1345 [2025-03-03 16:31:14,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 709 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-03 16:31:14,407 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 39 mSDsluCounter, 15395 mSDsCounter, 0 mSdLazyCounter, 3345 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 16802 SdHoareTripleChecker+Invalid, 3346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:14,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 16802 Invalid, 3346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3345 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 16:31:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2025-03-03 16:31:14,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1341. [2025-03-03 16:31:14,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1326 states have (on average 1.490950226244344) internal successors, (1977), 1326 states have internal predecessors, (1977), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 16:31:14,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 2003 transitions. [2025-03-03 16:31:14,429 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 2003 transitions. Word has length 359 [2025-03-03 16:31:14,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:14,429 INFO L471 AbstractCegarLoop]: Abstraction has 1341 states and 2003 transitions. [2025-03-03 16:31:14,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 23.666666666666668) internal successors, (355), 15 states have internal predecessors, (355), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 16:31:14,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 2003 transitions. [2025-03-03 16:31:14,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-03 16:31:14,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:14,431 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:31:14,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 16:31:14,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 16:31:14,632 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:14,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:14,633 INFO L85 PathProgramCache]: Analyzing trace with hash -731034880, now seen corresponding path program 2 times [2025-03-03 16:31:14,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:14,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999097112] [2025-03-03 16:31:14,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 16:31:14,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:14,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 362 statements into 2 equivalence classes. [2025-03-03 16:31:14,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 278 of 362 statements. [2025-03-03 16:31:14,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 16:31:14,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:14,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:14,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999097112] [2025-03-03 16:31:14,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999097112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:31:14,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:31:14,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:31:14,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670614683] [2025-03-03 16:31:14,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:14,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:31:14,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:14,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:31:14,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:31:14,952 INFO L87 Difference]: Start difference. First operand 1341 states and 2003 transitions. Second operand has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:15,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:15,303 INFO L93 Difference]: Finished difference Result 1345 states and 2007 transitions. [2025-03-03 16:31:15,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:31:15,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 362 [2025-03-03 16:31:15,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:15,308 INFO L225 Difference]: With dead ends: 1345 [2025-03-03 16:31:15,308 INFO L226 Difference]: Without dead ends: 1343 [2025-03-03 16:31:15,309 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-03 16:31:15,309 INFO L435 NwaCegarLoop]: 1395 mSDtfsCounter, 0 mSDsluCounter, 2785 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4180 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:15,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4180 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:31:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2025-03-03 16:31:15,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1343. [2025-03-03 16:31:15,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1328 states have (on average 1.490210843373494) internal successors, (1979), 1328 states have internal predecessors, (1979), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 16:31:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 2005 transitions. [2025-03-03 16:31:15,331 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 2005 transitions. Word has length 362 [2025-03-03 16:31:15,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:15,332 INFO L471 AbstractCegarLoop]: Abstraction has 1343 states and 2005 transitions. [2025-03-03 16:31:15,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 2005 transitions. [2025-03-03 16:31:15,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-03-03 16:31:15,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:15,334 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:31:15,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:31:15,334 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:15,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:15,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1182564796, now seen corresponding path program 1 times [2025-03-03 16:31:15,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:15,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025683996] [2025-03-03 16:31:15,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:15,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:15,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-03 16:31:15,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-03 16:31:15,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:15,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:15,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:15,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025683996] [2025-03-03 16:31:15,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025683996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:15,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254479053] [2025-03-03 16:31:15,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:15,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:15,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:15,583 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:15,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 16:31:15,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-03 16:31:16,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-03 16:31:16,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:16,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:16,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 1362 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-03 16:31:16,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:16,612 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:16,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:16,781 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:16,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254479053] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:16,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:16,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 5] total 11 [2025-03-03 16:31:16,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547243719] [2025-03-03 16:31:16,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:16,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:31:16,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:16,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:31:16,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:31:16,782 INFO L87 Difference]: Start difference. First operand 1343 states and 2005 transitions. Second operand has 6 states, 6 states have (on average 53.833333333333336) internal successors, (323), 6 states have internal predecessors, (323), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:17,898 INFO L93 Difference]: Finished difference Result 3573 states and 5346 transitions. [2025-03-03 16:31:17,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:31:17,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 53.833333333333336) internal successors, (323), 6 states have internal predecessors, (323), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 363 [2025-03-03 16:31:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:17,904 INFO L225 Difference]: With dead ends: 3573 [2025-03-03 16:31:17,905 INFO L226 Difference]: Without dead ends: 2543 [2025-03-03 16:31:17,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 719 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-03 16:31:17,908 INFO L435 NwaCegarLoop]: 2022 mSDtfsCounter, 2877 mSDsluCounter, 3495 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2883 SdHoareTripleChecker+Valid, 5517 SdHoareTripleChecker+Invalid, 2052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:17,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2883 Valid, 5517 Invalid, 2052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 16:31:17,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2025-03-03 16:31:17,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2004. [2025-03-03 16:31:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2004 states, 1984 states have (on average 1.4879032258064515) internal successors, (2952), 1984 states have internal predecessors, (2952), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 16:31:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 2988 transitions. [2025-03-03 16:31:17,962 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 2988 transitions. Word has length 363 [2025-03-03 16:31:17,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:17,963 INFO L471 AbstractCegarLoop]: Abstraction has 2004 states and 2988 transitions. [2025-03-03 16:31:17,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 53.833333333333336) internal successors, (323), 6 states have internal predecessors, (323), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:17,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2988 transitions. [2025-03-03 16:31:17,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-03-03 16:31:17,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:17,966 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:31:17,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 16:31:18,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:18,167 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:18,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:18,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2009195767, now seen corresponding path program 1 times [2025-03-03 16:31:18,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:18,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995682975] [2025-03-03 16:31:18,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:18,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:18,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-03 16:31:18,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-03 16:31:18,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:18,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:18,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:18,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995682975] [2025-03-03 16:31:18,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995682975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:18,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688932812] [2025-03-03 16:31:18,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:18,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:18,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:18,438 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:18,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 16:31:18,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-03 16:31:18,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-03 16:31:18,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:18,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:18,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 1362 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 16:31:18,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:18,999 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:31:18,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688932812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:31:18,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:31:18,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2025-03-03 16:31:18,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082689188] [2025-03-03 16:31:18,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:18,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:31:18,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:19,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:31:19,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:31:19,000 INFO L87 Difference]: Start difference. First operand 2004 states and 2988 transitions. Second operand has 6 states, 6 states have (on average 53.833333333333336) internal successors, (323), 6 states have internal predecessors, (323), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:20,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:20,147 INFO L93 Difference]: Finished difference Result 4486 states and 6682 transitions. [2025-03-03 16:31:20,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:31:20,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 53.833333333333336) internal successors, (323), 6 states have internal predecessors, (323), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 363 [2025-03-03 16:31:20,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:20,157 INFO L225 Difference]: With dead ends: 4486 [2025-03-03 16:31:20,157 INFO L226 Difference]: Without dead ends: 2964 [2025-03-03 16:31:20,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:31:20,160 INFO L435 NwaCegarLoop]: 1761 mSDtfsCounter, 631 mSDsluCounter, 5261 mSDsCounter, 0 mSdLazyCounter, 3036 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 7022 SdHoareTripleChecker+Invalid, 3044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:20,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 7022 Invalid, 3044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 3036 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 16:31:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2025-03-03 16:31:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 2060. [2025-03-03 16:31:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2060 states, 2040 states have (on average 1.4823529411764707) internal successors, (3024), 2040 states have internal predecessors, (3024), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 16:31:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 3060 transitions. [2025-03-03 16:31:20,208 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 3060 transitions. Word has length 363 [2025-03-03 16:31:20,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:20,209 INFO L471 AbstractCegarLoop]: Abstraction has 2060 states and 3060 transitions. [2025-03-03 16:31:20,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 53.833333333333336) internal successors, (323), 6 states have internal predecessors, (323), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 3060 transitions. [2025-03-03 16:31:20,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-03-03 16:31:20,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:20,211 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:31:20,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 16:31:20,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 16:31:20,412 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:20,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:20,413 INFO L85 PathProgramCache]: Analyzing trace with hash 746627737, now seen corresponding path program 1 times [2025-03-03 16:31:20,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:20,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049936318] [2025-03-03 16:31:20,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:20,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:20,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-03 16:31:20,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-03 16:31:20,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:20,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:20,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:20,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049936318] [2025-03-03 16:31:20,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049936318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:20,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283280016] [2025-03-03 16:31:20,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:20,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:20,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:20,671 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:20,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 16:31:21,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-03 16:31:21,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-03 16:31:21,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:21,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:21,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 1365 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 16:31:21,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 16:31:21,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:21,817 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:21,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283280016] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:21,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:21,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 8] total 14 [2025-03-03 16:31:21,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535583857] [2025-03-03 16:31:21,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:21,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:31:21,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:21,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:31:21,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-03 16:31:21,819 INFO L87 Difference]: Start difference. First operand 2060 states and 3060 transitions. Second operand has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:31:23,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:23,362 INFO L93 Difference]: Finished difference Result 5006 states and 7439 transitions. [2025-03-03 16:31:23,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:31:23,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 364 [2025-03-03 16:31:23,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:23,370 INFO L225 Difference]: With dead ends: 5006 [2025-03-03 16:31:23,370 INFO L226 Difference]: Without dead ends: 3430 [2025-03-03 16:31:23,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-03-03 16:31:23,372 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 3280 mSDsluCounter, 2532 mSDsCounter, 0 mSdLazyCounter, 3286 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3285 SdHoareTripleChecker+Valid, 3380 SdHoareTripleChecker+Invalid, 3296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 3286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:23,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3285 Valid, 3380 Invalid, 3296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 3286 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 16:31:23,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2025-03-03 16:31:23,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 2190. [2025-03-03 16:31:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2190 states, 2166 states have (on average 1.4778393351800554) internal successors, (3201), 2166 states have internal predecessors, (3201), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 16:31:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 2190 states and 3245 transitions. [2025-03-03 16:31:23,412 INFO L78 Accepts]: Start accepts. Automaton has 2190 states and 3245 transitions. Word has length 364 [2025-03-03 16:31:23,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:23,412 INFO L471 AbstractCegarLoop]: Abstraction has 2190 states and 3245 transitions. [2025-03-03 16:31:23,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:31:23,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 3245 transitions. [2025-03-03 16:31:23,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-03-03 16:31:23,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:23,416 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:31:23,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 16:31:23,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 16:31:23,617 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:23,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:23,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1801957726, now seen corresponding path program 1 times [2025-03-03 16:31:23,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:23,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583293636] [2025-03-03 16:31:23,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:23,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:23,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-03 16:31:23,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-03 16:31:23,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:23,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:23,822 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:23,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:23,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583293636] [2025-03-03 16:31:23,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583293636] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:23,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82476481] [2025-03-03 16:31:23,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:23,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:23,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:23,825 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:23,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 16:31:24,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-03 16:31:24,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-03 16:31:24,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:24,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:24,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 1365 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 16:31:24,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 16:31:24,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:24,970 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:24,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82476481] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:24,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:24,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 8] total 14 [2025-03-03 16:31:24,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069784533] [2025-03-03 16:31:24,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:24,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:31:24,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:24,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:31:24,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-03 16:31:24,972 INFO L87 Difference]: Start difference. First operand 2190 states and 3245 transitions. Second operand has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:26,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:26,457 INFO L93 Difference]: Finished difference Result 4988 states and 7382 transitions. [2025-03-03 16:31:26,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:31:26,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 364 [2025-03-03 16:31:26,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:26,473 INFO L225 Difference]: With dead ends: 4988 [2025-03-03 16:31:26,473 INFO L226 Difference]: Without dead ends: 3282 [2025-03-03 16:31:26,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-03-03 16:31:26,476 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 2582 mSDsluCounter, 2529 mSDsCounter, 0 mSdLazyCounter, 3290 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2587 SdHoareTripleChecker+Valid, 3376 SdHoareTripleChecker+Invalid, 3302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:26,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2587 Valid, 3376 Invalid, 3302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3290 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 16:31:26,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2025-03-03 16:31:26,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 2272. [2025-03-03 16:31:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2248 states have (on average 1.472864768683274) internal successors, (3311), 2248 states have internal predecessors, (3311), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 16:31:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 3355 transitions. [2025-03-03 16:31:26,538 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 3355 transitions. Word has length 364 [2025-03-03 16:31:26,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:26,539 INFO L471 AbstractCegarLoop]: Abstraction has 2272 states and 3355 transitions. [2025-03-03 16:31:26,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:26,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 3355 transitions. [2025-03-03 16:31:26,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-03-03 16:31:26,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:26,541 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:31:26,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 16:31:26,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 16:31:26,741 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:26,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:26,742 INFO L85 PathProgramCache]: Analyzing trace with hash 371366168, now seen corresponding path program 1 times [2025-03-03 16:31:26,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:26,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201815797] [2025-03-03 16:31:26,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:26,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:26,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-03 16:31:26,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-03 16:31:26,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:26,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:26,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:26,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201815797] [2025-03-03 16:31:26,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201815797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:26,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227198418] [2025-03-03 16:31:26,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:26,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:26,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:26,952 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:26,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 16:31:27,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-03 16:31:27,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-03 16:31:27,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:27,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:27,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 1365 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-03-03 16:31:27,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 16 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 16:31:28,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:29,489 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:29,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227198418] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:29,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:29,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4, 23] total 34 [2025-03-03 16:31:29,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941515894] [2025-03-03 16:31:29,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:29,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 16:31:29,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:29,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 16:31:29,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=984, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 16:31:29,491 INFO L87 Difference]: Start difference. First operand 2272 states and 3355 transitions. Second operand has 11 states, 11 states have (on average 29.454545454545453) internal successors, (324), 11 states have internal predecessors, (324), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:31:30,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:30,613 INFO L93 Difference]: Finished difference Result 4757 states and 6973 transitions. [2025-03-03 16:31:30,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:31:30,614 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 29.454545454545453) internal successors, (324), 11 states have internal predecessors, (324), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 364 [2025-03-03 16:31:30,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:30,621 INFO L225 Difference]: With dead ends: 4757 [2025-03-03 16:31:30,621 INFO L226 Difference]: Without dead ends: 2895 [2025-03-03 16:31:30,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 698 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=1371, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 16:31:30,626 INFO L435 NwaCegarLoop]: 1434 mSDtfsCounter, 1968 mSDsluCounter, 9883 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1973 SdHoareTripleChecker+Valid, 11317 SdHoareTripleChecker+Invalid, 2467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:30,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1973 Valid, 11317 Invalid, 2467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 16:31:30,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2025-03-03 16:31:30,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2550. [2025-03-03 16:31:30,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2550 states, 2518 states have (on average 1.4642573471008737) internal successors, (3687), 2518 states have internal predecessors, (3687), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 16:31:30,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 3747 transitions. [2025-03-03 16:31:30,699 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 3747 transitions. Word has length 364 [2025-03-03 16:31:30,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:30,700 INFO L471 AbstractCegarLoop]: Abstraction has 2550 states and 3747 transitions. [2025-03-03 16:31:30,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.454545454545453) internal successors, (324), 11 states have internal predecessors, (324), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:31:30,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 3747 transitions. [2025-03-03 16:31:30,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-03-03 16:31:30,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:30,702 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:31:30,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-03 16:31:30,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 16:31:30,903 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:30,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:30,903 INFO L85 PathProgramCache]: Analyzing trace with hash -79210851, now seen corresponding path program 1 times [2025-03-03 16:31:30,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:30,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004269929] [2025-03-03 16:31:30,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:30,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:30,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-03 16:31:30,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-03 16:31:30,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:30,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:31,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:31,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004269929] [2025-03-03 16:31:31,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004269929] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:31,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744570930] [2025-03-03 16:31:31,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:31,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:31,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:31,262 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:31,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 16:31:31,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-03 16:31:31,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-03 16:31:31,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:31,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:32,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 1365 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 16:31:32,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:32,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:31:32,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744570930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:31:32,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:31:32,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4] total 11 [2025-03-03 16:31:32,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967828972] [2025-03-03 16:31:32,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:32,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:31:32,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:32,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:31:32,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:31:32,091 INFO L87 Difference]: Start difference. First operand 2550 states and 3747 transitions. Second operand has 9 states, 9 states have (on average 36.0) internal successors, (324), 9 states have internal predecessors, (324), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:34,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:34,118 INFO L93 Difference]: Finished difference Result 4583 states and 6744 transitions. [2025-03-03 16:31:34,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:31:34,119 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 36.0) internal successors, (324), 9 states have internal predecessors, (324), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 364 [2025-03-03 16:31:34,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:34,123 INFO L225 Difference]: With dead ends: 4583 [2025-03-03 16:31:34,123 INFO L226 Difference]: Without dead ends: 2662 [2025-03-03 16:31:34,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:31:34,124 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 1646 mSDsluCounter, 5017 mSDsCounter, 0 mSdLazyCounter, 5752 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 5866 SdHoareTripleChecker+Invalid, 5755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:34,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 5866 Invalid, 5755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5752 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 16:31:34,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2025-03-03 16:31:34,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2625. [2025-03-03 16:31:34,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2625 states, 2593 states have (on average 1.4608561511762437) internal successors, (3788), 2593 states have internal predecessors, (3788), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 16:31:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2625 states and 3848 transitions. [2025-03-03 16:31:34,162 INFO L78 Accepts]: Start accepts. Automaton has 2625 states and 3848 transitions. Word has length 364 [2025-03-03 16:31:34,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:34,162 INFO L471 AbstractCegarLoop]: Abstraction has 2625 states and 3848 transitions. [2025-03-03 16:31:34,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.0) internal successors, (324), 9 states have internal predecessors, (324), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:34,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 3848 transitions. [2025-03-03 16:31:34,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-03 16:31:34,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:34,165 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:31:34,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-03 16:31:34,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:34,366 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:34,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:34,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1459414254, now seen corresponding path program 1 times [2025-03-03 16:31:34,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:34,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613970483] [2025-03-03 16:31:34,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:34,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:34,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-03 16:31:34,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-03 16:31:34,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:34,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:34,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:34,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613970483] [2025-03-03 16:31:34,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613970483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:34,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274894538] [2025-03-03 16:31:34,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:34,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:34,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:34,580 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:34,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 16:31:35,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-03 16:31:35,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-03 16:31:35,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:35,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:35,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 1368 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-03 16:31:35,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 16:31:35,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:36,007 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:36,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274894538] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:36,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:36,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4, 9] total 22 [2025-03-03 16:31:36,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039941113] [2025-03-03 16:31:36,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:36,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 16:31:36,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:36,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 16:31:36,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 16:31:36,009 INFO L87 Difference]: Start difference. First operand 2625 states and 3848 transitions. Second operand has 13 states, 13 states have (on average 25.0) internal successors, (325), 13 states have internal predecessors, (325), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:31:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:37,359 INFO L93 Difference]: Finished difference Result 4480 states and 6571 transitions. [2025-03-03 16:31:37,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:31:37,360 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 25.0) internal successors, (325), 13 states have internal predecessors, (325), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 365 [2025-03-03 16:31:37,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:37,367 INFO L225 Difference]: With dead ends: 4480 [2025-03-03 16:31:37,368 INFO L226 Difference]: Without dead ends: 2631 [2025-03-03 16:31:37,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 712 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2025-03-03 16:31:37,370 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 6513 mSDsluCounter, 2530 mSDsCounter, 0 mSdLazyCounter, 3330 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6515 SdHoareTripleChecker+Valid, 3365 SdHoareTripleChecker+Invalid, 3342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:37,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6515 Valid, 3365 Invalid, 3342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3330 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 16:31:37,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2025-03-03 16:31:37,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2631. [2025-03-03 16:31:37,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2631 states, 2599 states have (on average 1.4578684109272797) internal successors, (3789), 2599 states have internal predecessors, (3789), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 16:31:37,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 3849 transitions. [2025-03-03 16:31:37,414 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 3849 transitions. Word has length 365 [2025-03-03 16:31:37,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:37,415 INFO L471 AbstractCegarLoop]: Abstraction has 2631 states and 3849 transitions. [2025-03-03 16:31:37,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.0) internal successors, (325), 13 states have internal predecessors, (325), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:31:37,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3849 transitions. [2025-03-03 16:31:37,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-03 16:31:37,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:37,418 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:31:37,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-03 16:31:37,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 16:31:37,619 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:37,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:37,619 INFO L85 PathProgramCache]: Analyzing trace with hash -261654928, now seen corresponding path program 1 times [2025-03-03 16:31:37,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:37,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383469441] [2025-03-03 16:31:37,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:37,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:37,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-03 16:31:37,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-03 16:31:37,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:37,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:37,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:37,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383469441] [2025-03-03 16:31:37,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383469441] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:37,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913139551] [2025-03-03 16:31:37,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:37,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:37,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:37,816 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:37,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 16:31:38,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-03 16:31:38,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-03 16:31:38,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:38,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:38,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 1371 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-03 16:31:38,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:39,050 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 16:31:39,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:39,306 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:39,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913139551] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:39,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:39,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 9] total 19 [2025-03-03 16:31:39,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931003950] [2025-03-03 16:31:39,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:39,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:31:39,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:39,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:31:39,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:31:39,307 INFO L87 Difference]: Start difference. First operand 2631 states and 3849 transitions. Second operand has 10 states, 10 states have (on average 32.6) internal successors, (326), 10 states have internal predecessors, (326), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:40,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:40,669 INFO L93 Difference]: Finished difference Result 4481 states and 6561 transitions. [2025-03-03 16:31:40,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:31:40,669 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 32.6) internal successors, (326), 10 states have internal predecessors, (326), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 366 [2025-03-03 16:31:40,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:40,674 INFO L225 Difference]: With dead ends: 4481 [2025-03-03 16:31:40,674 INFO L226 Difference]: Without dead ends: 2634 [2025-03-03 16:31:40,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 737 GetRequests, 717 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2025-03-03 16:31:40,676 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 6584 mSDsluCounter, 2521 mSDsCounter, 0 mSdLazyCounter, 3331 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6588 SdHoareTripleChecker+Valid, 3356 SdHoareTripleChecker+Invalid, 3348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:40,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6588 Valid, 3356 Invalid, 3348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3331 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 16:31:40,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2025-03-03 16:31:40,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2634. [2025-03-03 16:31:40,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 2602 states have (on average 1.4573405073020753) internal successors, (3792), 2602 states have internal predecessors, (3792), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 16:31:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 3852 transitions. [2025-03-03 16:31:40,714 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 3852 transitions. Word has length 366 [2025-03-03 16:31:40,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:40,715 INFO L471 AbstractCegarLoop]: Abstraction has 2634 states and 3852 transitions. [2025-03-03 16:31:40,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.6) internal successors, (326), 10 states have internal predecessors, (326), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:40,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 3852 transitions. [2025-03-03 16:31:40,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-03-03 16:31:40,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:40,717 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:31:40,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-03 16:31:40,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:40,918 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:40,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:40,919 INFO L85 PathProgramCache]: Analyzing trace with hash -488097051, now seen corresponding path program 1 times [2025-03-03 16:31:40,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:40,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435542326] [2025-03-03 16:31:40,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:40,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:40,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-03 16:31:41,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-03 16:31:41,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:41,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:41,188 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:41,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:41,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435542326] [2025-03-03 16:31:41,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435542326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:41,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628558162] [2025-03-03 16:31:41,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:41,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:41,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:41,191 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:41,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 16:31:41,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-03 16:31:41,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-03 16:31:41,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:41,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:41,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 1372 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 16:31:41,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:42,253 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 16:31:42,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:42,461 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:42,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628558162] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:42,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:42,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 7] total 17 [2025-03-03 16:31:42,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818554579] [2025-03-03 16:31:42,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:42,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:31:42,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:42,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:31:42,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-03 16:31:42,462 INFO L87 Difference]: Start difference. First operand 2634 states and 3852 transitions. Second operand has 10 states, 10 states have (on average 32.7) internal successors, (327), 10 states have internal predecessors, (327), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:45,452 INFO L93 Difference]: Finished difference Result 4569 states and 6680 transitions. [2025-03-03 16:31:45,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:31:45,453 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 32.7) internal successors, (327), 10 states have internal predecessors, (327), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 367 [2025-03-03 16:31:45,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:45,457 INFO L225 Difference]: With dead ends: 4569 [2025-03-03 16:31:45,457 INFO L226 Difference]: Without dead ends: 2640 [2025-03-03 16:31:45,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 721 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:31:45,460 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 1622 mSDsluCounter, 5821 mSDsCounter, 0 mSdLazyCounter, 6678 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 6657 SdHoareTripleChecker+Invalid, 6682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:45,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1625 Valid, 6657 Invalid, 6682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6678 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 16:31:45,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2025-03-03 16:31:45,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2640. [2025-03-03 16:31:45,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2640 states, 2608 states have (on average 1.4543711656441718) internal successors, (3793), 2608 states have internal predecessors, (3793), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 16:31:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 3853 transitions. [2025-03-03 16:31:45,509 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 3853 transitions. Word has length 367 [2025-03-03 16:31:45,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:45,510 INFO L471 AbstractCegarLoop]: Abstraction has 2640 states and 3853 transitions. [2025-03-03 16:31:45,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.7) internal successors, (327), 10 states have internal predecessors, (327), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:45,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3853 transitions. [2025-03-03 16:31:45,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-03-03 16:31:45,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:45,513 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:31:45,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-03 16:31:45,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:45,714 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:45,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:45,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1035899569, now seen corresponding path program 1 times [2025-03-03 16:31:45,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:45,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890922757] [2025-03-03 16:31:45,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:45,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:45,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-03 16:31:45,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-03 16:31:45,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:45,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:45,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:45,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890922757] [2025-03-03 16:31:45,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890922757] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:45,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808548368] [2025-03-03 16:31:45,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:45,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:45,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:45,926 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:45,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-03 16:31:46,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-03 16:31:46,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-03 16:31:46,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:46,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:46,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 1375 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 16:31:46,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:47,050 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 16:31:47,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:47,306 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:47,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808548368] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:47,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:47,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 10] total 20 [2025-03-03 16:31:47,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434781459] [2025-03-03 16:31:47,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:47,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:31:47,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:47,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:31:47,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:31:47,308 INFO L87 Difference]: Start difference. First operand 2640 states and 3853 transitions. Second operand has 10 states, 10 states have (on average 32.8) internal successors, (328), 10 states have internal predecessors, (328), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:48,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:48,912 INFO L93 Difference]: Finished difference Result 4493 states and 6562 transitions. [2025-03-03 16:31:48,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:31:48,913 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 32.8) internal successors, (328), 10 states have internal predecessors, (328), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 368 [2025-03-03 16:31:48,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:48,923 INFO L225 Difference]: With dead ends: 4493 [2025-03-03 16:31:48,926 INFO L226 Difference]: Without dead ends: 2644 [2025-03-03 16:31:48,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 720 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-03-03 16:31:48,929 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 6531 mSDsluCounter, 2491 mSDsCounter, 0 mSdLazyCounter, 3330 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6535 SdHoareTripleChecker+Valid, 3325 SdHoareTripleChecker+Invalid, 3344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:48,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6535 Valid, 3325 Invalid, 3344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3330 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 16:31:48,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2025-03-03 16:31:48,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2644. [2025-03-03 16:31:48,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2612 states have (on average 1.4536753445635529) internal successors, (3797), 2612 states have internal predecessors, (3797), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 16:31:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3857 transitions. [2025-03-03 16:31:48,974 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3857 transitions. Word has length 368 [2025-03-03 16:31:48,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:48,974 INFO L471 AbstractCegarLoop]: Abstraction has 2644 states and 3857 transitions. [2025-03-03 16:31:48,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.8) internal successors, (328), 10 states have internal predecessors, (328), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:48,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3857 transitions. [2025-03-03 16:31:48,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-03-03 16:31:48,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:48,977 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:31:48,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-03 16:31:49,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:49,181 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:49,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:49,181 INFO L85 PathProgramCache]: Analyzing trace with hash -403646587, now seen corresponding path program 1 times [2025-03-03 16:31:49,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:49,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293817300] [2025-03-03 16:31:49,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:49,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:49,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-03 16:31:49,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-03 16:31:49,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:49,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:49,446 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:49,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:49,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293817300] [2025-03-03 16:31:49,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293817300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:49,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26940623] [2025-03-03 16:31:49,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:49,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:49,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:49,449 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:49,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-03 16:31:50,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-03 16:31:50,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-03 16:31:50,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:50,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:50,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-03 16:31:50,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-03 16:31:50,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:51,077 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:51,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26940623] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:51,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:51,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 9] total 19 [2025-03-03 16:31:51,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227287479] [2025-03-03 16:31:51,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:51,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:31:51,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:51,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:31:51,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:31:51,079 INFO L87 Difference]: Start difference. First operand 2644 states and 3857 transitions. Second operand has 10 states, 10 states have (on average 32.9) internal successors, (329), 10 states have internal predecessors, (329), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:52,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:52,783 INFO L93 Difference]: Finished difference Result 4499 states and 6568 transitions. [2025-03-03 16:31:52,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:31:52,784 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 32.9) internal successors, (329), 10 states have internal predecessors, (329), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 369 [2025-03-03 16:31:52,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:52,792 INFO L225 Difference]: With dead ends: 4499 [2025-03-03 16:31:52,792 INFO L226 Difference]: Without dead ends: 2646 [2025-03-03 16:31:52,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 723 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2025-03-03 16:31:52,795 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 6504 mSDsluCounter, 2518 mSDsCounter, 0 mSdLazyCounter, 3331 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6506 SdHoareTripleChecker+Valid, 3352 SdHoareTripleChecker+Invalid, 3342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:52,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6506 Valid, 3352 Invalid, 3342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3331 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 16:31:52,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2025-03-03 16:31:52,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2646. [2025-03-03 16:31:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2646 states, 2614 states have (on average 1.453328232593726) internal successors, (3799), 2614 states have internal predecessors, (3799), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 16:31:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 3859 transitions. [2025-03-03 16:31:52,865 INFO L78 Accepts]: Start accepts. Automaton has 2646 states and 3859 transitions. Word has length 369 [2025-03-03 16:31:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:52,869 INFO L471 AbstractCegarLoop]: Abstraction has 2646 states and 3859 transitions. [2025-03-03 16:31:52,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.9) internal successors, (329), 10 states have internal predecessors, (329), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2646 states and 3859 transitions. [2025-03-03 16:31:52,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-03-03 16:31:52,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:52,871 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:31:52,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-03 16:31:53,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:53,075 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:53,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:53,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1738292985, now seen corresponding path program 1 times [2025-03-03 16:31:53,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:53,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147857839] [2025-03-03 16:31:53,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:53,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:53,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-03-03 16:31:53,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-03-03 16:31:53,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:53,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:53,336 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:53,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:53,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147857839] [2025-03-03 16:31:53,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147857839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:53,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194984291] [2025-03-03 16:31:53,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:53,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:53,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:53,339 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:53,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-03 16:31:53,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-03-03 16:31:54,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-03-03 16:31:54,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:54,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:54,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 1379 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-03 16:31:54,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-03 16:31:54,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:54,719 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:54,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194984291] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:54,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:54,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 8] total 18 [2025-03-03 16:31:54,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847606469] [2025-03-03 16:31:54,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:54,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:31:54,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:54,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:31:54,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-03 16:31:54,720 INFO L87 Difference]: Start difference. First operand 2646 states and 3859 transitions. Second operand has 10 states, 10 states have (on average 33.0) internal successors, (330), 10 states have internal predecessors, (330), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:56,105 INFO L93 Difference]: Finished difference Result 4529 states and 6608 transitions. [2025-03-03 16:31:56,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:31:56,105 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 33.0) internal successors, (330), 10 states have internal predecessors, (330), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 370 [2025-03-03 16:31:56,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:56,108 INFO L225 Difference]: With dead ends: 4529 [2025-03-03 16:31:56,108 INFO L226 Difference]: Without dead ends: 2649 [2025-03-03 16:31:56,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 726 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2025-03-03 16:31:56,110 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 3288 mSDsluCounter, 2500 mSDsCounter, 0 mSdLazyCounter, 3331 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3292 SdHoareTripleChecker+Valid, 3334 SdHoareTripleChecker+Invalid, 3338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:56,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3292 Valid, 3334 Invalid, 3338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3331 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 16:31:56,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2025-03-03 16:31:56,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 2649. [2025-03-03 16:31:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2649 states, 2617 states have (on average 1.4528085594191822) internal successors, (3802), 2617 states have internal predecessors, (3802), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 16:31:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2649 states and 3862 transitions. [2025-03-03 16:31:56,181 INFO L78 Accepts]: Start accepts. Automaton has 2649 states and 3862 transitions. Word has length 370 [2025-03-03 16:31:56,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:56,181 INFO L471 AbstractCegarLoop]: Abstraction has 2649 states and 3862 transitions. [2025-03-03 16:31:56,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 33.0) internal successors, (330), 10 states have internal predecessors, (330), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:56,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 3862 transitions. [2025-03-03 16:31:56,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-03 16:31:56,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:56,188 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:31:56,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-03 16:31:56,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-03 16:31:56,392 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:56,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:56,393 INFO L85 PathProgramCache]: Analyzing trace with hash -692410181, now seen corresponding path program 1 times [2025-03-03 16:31:56,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:56,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249635485] [2025-03-03 16:31:56,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:56,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:56,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-03 16:31:56,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-03 16:31:56,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:56,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:56,616 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:56,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:56,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249635485] [2025-03-03 16:31:56,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249635485] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:56,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789788648] [2025-03-03 16:31:56,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:56,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:56,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:56,619 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:56,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-03 16:31:57,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-03 16:31:57,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-03 16:31:57,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:57,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:57,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-03-03 16:31:57,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 16:31:57,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:58,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789788648] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:58,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:58,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4, 13] total 26 [2025-03-03 16:31:58,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812873786] [2025-03-03 16:31:58,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:58,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 16:31:58,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:58,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 16:31:58,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2025-03-03 16:31:58,511 INFO L87 Difference]: Start difference. First operand 2649 states and 3862 transitions. Second operand has 13 states, 13 states have (on average 25.46153846153846) internal successors, (331), 13 states have internal predecessors, (331), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:03,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:03,718 INFO L93 Difference]: Finished difference Result 5915 states and 8533 transitions. [2025-03-03 16:32:03,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:32:03,718 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 25.46153846153846) internal successors, (331), 13 states have internal predecessors, (331), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 371 [2025-03-03 16:32:03,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:03,723 INFO L225 Difference]: With dead ends: 5915 [2025-03-03 16:32:03,724 INFO L226 Difference]: Without dead ends: 3981 [2025-03-03 16:32:03,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 720 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=239, Invalid=1021, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 16:32:03,726 INFO L435 NwaCegarLoop]: 1037 mSDtfsCounter, 1456 mSDsluCounter, 8784 mSDsCounter, 0 mSdLazyCounter, 8542 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1461 SdHoareTripleChecker+Valid, 9821 SdHoareTripleChecker+Invalid, 8571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 8542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:03,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1461 Valid, 9821 Invalid, 8571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 8542 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-03 16:32:03,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2025-03-03 16:32:03,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 2691. [2025-03-03 16:32:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2691 states, 2659 states have (on average 1.450169236555096) internal successors, (3856), 2659 states have internal predecessors, (3856), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 16:32:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 3916 transitions. [2025-03-03 16:32:03,779 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 3916 transitions. Word has length 371 [2025-03-03 16:32:03,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:03,779 INFO L471 AbstractCegarLoop]: Abstraction has 2691 states and 3916 transitions. [2025-03-03 16:32:03,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.46153846153846) internal successors, (331), 13 states have internal predecessors, (331), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:03,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 3916 transitions. [2025-03-03 16:32:03,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-03 16:32:03,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:03,782 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:32:03,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-03 16:32:03,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-03 16:32:03,986 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:03,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:03,988 INFO L85 PathProgramCache]: Analyzing trace with hash 2130861867, now seen corresponding path program 1 times [2025-03-03 16:32:03,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:03,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183439899] [2025-03-03 16:32:03,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:03,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:04,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-03 16:32:04,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-03 16:32:04,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:04,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:04,194 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:32:04,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:04,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183439899] [2025-03-03 16:32:04,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183439899] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:04,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312024685] [2025-03-03 16:32:04,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:04,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:04,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:32:04,197 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:32:04,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-03 16:32:04,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-03 16:32:04,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-03 16:32:04,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:04,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:04,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 16:32:04,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:32:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 16:32:05,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:32:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:32:05,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312024685] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:05,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:32:05,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 7] total 17 [2025-03-03 16:32:05,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294125891] [2025-03-03 16:32:05,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:05,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:32:05,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:05,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:32:05,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-03 16:32:05,784 INFO L87 Difference]: Start difference. First operand 2691 states and 3916 transitions. Second operand has 10 states, 10 states have (on average 33.1) internal successors, (331), 10 states have internal predecessors, (331), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:32:08,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:08,166 INFO L93 Difference]: Finished difference Result 4827 states and 7011 transitions. [2025-03-03 16:32:08,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:32:08,166 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 33.1) internal successors, (331), 10 states have internal predecessors, (331), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 371 [2025-03-03 16:32:08,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:08,170 INFO L225 Difference]: With dead ends: 4827 [2025-03-03 16:32:08,170 INFO L226 Difference]: Without dead ends: 2709 [2025-03-03 16:32:08,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 747 GetRequests, 729 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:32:08,172 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 1768 mSDsluCounter, 5136 mSDsCounter, 0 mSdLazyCounter, 5879 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1772 SdHoareTripleChecker+Valid, 6018 SdHoareTripleChecker+Invalid, 5886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 5879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:08,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1772 Valid, 6018 Invalid, 5886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 5879 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 16:32:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2709 states. [2025-03-03 16:32:08,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2709 to 2709. [2025-03-03 16:32:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2709 states, 2677 states have (on average 1.443033246171087) internal successors, (3863), 2677 states have internal predecessors, (3863), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 16:32:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2709 states to 2709 states and 3923 transitions. [2025-03-03 16:32:08,216 INFO L78 Accepts]: Start accepts. Automaton has 2709 states and 3923 transitions. Word has length 371 [2025-03-03 16:32:08,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:08,216 INFO L471 AbstractCegarLoop]: Abstraction has 2709 states and 3923 transitions. [2025-03-03 16:32:08,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 33.1) internal successors, (331), 10 states have internal predecessors, (331), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:32:08,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2709 states and 3923 transitions. [2025-03-03 16:32:08,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-03 16:32:08,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:08,221 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:32:08,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-03 16:32:08,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:08,424 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:08,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:08,424 INFO L85 PathProgramCache]: Analyzing trace with hash -589857218, now seen corresponding path program 1 times [2025-03-03 16:32:08,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:08,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353249099] [2025-03-03 16:32:08,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:08,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:08,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-03 16:32:08,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-03 16:32:08,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:08,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:32:08,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:08,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353249099] [2025-03-03 16:32:08,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353249099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:08,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050949461] [2025-03-03 16:32:08,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:08,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:08,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:32:08,643 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:32:08,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-03 16:32:09,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-03 16:32:09,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-03 16:32:09,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:09,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:09,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 1383 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 16:32:09,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:32:09,768 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 16:32:09,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:32:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:32:09,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050949461] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:09,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:32:09,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4, 7] total 16 [2025-03-03 16:32:09,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274467304] [2025-03-03 16:32:09,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:09,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:32:09,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:09,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:32:09,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-03 16:32:09,920 INFO L87 Difference]: Start difference. First operand 2709 states and 3923 transitions. Second operand has 9 states, 9 states have (on average 36.888888888888886) internal successors, (332), 9 states have internal predecessors, (332), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:32:12,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:12,873 INFO L93 Difference]: Finished difference Result 6511 states and 9449 transitions. [2025-03-03 16:32:12,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:32:12,873 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 36.888888888888886) internal successors, (332), 9 states have internal predecessors, (332), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 372 [2025-03-03 16:32:12,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:12,877 INFO L225 Difference]: With dead ends: 6511 [2025-03-03 16:32:12,877 INFO L226 Difference]: Without dead ends: 3744 [2025-03-03 16:32:12,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 749 GetRequests, 732 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:32:12,879 INFO L435 NwaCegarLoop]: 2029 mSDtfsCounter, 3802 mSDsluCounter, 6956 mSDsCounter, 0 mSdLazyCounter, 6584 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3804 SdHoareTripleChecker+Valid, 8985 SdHoareTripleChecker+Invalid, 6591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 6584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:12,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3804 Valid, 8985 Invalid, 6591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 6584 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 16:32:12,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2025-03-03 16:32:12,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 3732. [2025-03-03 16:32:12,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3732 states, 3686 states have (on average 1.4427563754747694) internal successors, (5318), 3686 states have internal predecessors, (5318), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 16:32:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3732 states to 3732 states and 5406 transitions. [2025-03-03 16:32:12,935 INFO L78 Accepts]: Start accepts. Automaton has 3732 states and 5406 transitions. Word has length 372 [2025-03-03 16:32:12,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:12,935 INFO L471 AbstractCegarLoop]: Abstraction has 3732 states and 5406 transitions. [2025-03-03 16:32:12,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.888888888888886) internal successors, (332), 9 states have internal predecessors, (332), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:32:12,935 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 5406 transitions. [2025-03-03 16:32:12,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-03 16:32:12,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:12,937 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:32:12,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-03 16:32:13,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:13,138 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:13,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:13,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1534202688, now seen corresponding path program 1 times [2025-03-03 16:32:13,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:13,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241520475] [2025-03-03 16:32:13,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:13,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:13,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-03 16:32:13,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-03 16:32:13,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:13,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:32:13,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:13,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241520475] [2025-03-03 16:32:13,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241520475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:13,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525433867] [2025-03-03 16:32:13,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:13,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:13,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:32:13,334 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:32:13,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-03 16:32:13,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-03 16:32:14,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-03 16:32:14,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:14,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:14,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 1384 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 16:32:14,046 INFO L279 TraceCheckSpWp]: Computing forward predicates...