./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.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 77ae88daffb8285870a38f38e30db5571fe2930110ef63da660dc306a4cb95e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:49:47,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:49:47,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 20:49:47,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:49:47,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:49:47,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:49:47,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:49:47,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:49:47,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:49:47,371 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:49:47,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:49:47,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:49:47,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:49:47,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:49:47,372 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:49:47,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:49:47,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:49:47,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:49:47,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:49:47,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:49:47,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:49:47,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:49:47,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:49:47,373 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:49:47,373 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:49:47,374 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:49:47,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:49:47,374 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:49:47,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:49:47,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:49:47,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:49:47,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:49:47,374 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:49:47,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:49:47,374 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:49:47,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:49:47,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:49:47,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:49:47,375 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:49:47,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:49:47,375 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 -> 77ae88daffb8285870a38f38e30db5571fe2930110ef63da660dc306a4cb95e3 [2025-03-16 20:49:47,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:49:47,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:49:47,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:49:47,619 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:49:47,619 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:49:47,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c [2025-03-16 20:49:48,713 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b10954200/95c14186ef5e4496a98521d6d32c606b/FLAG4b5c5764c [2025-03-16 20:49:48,973 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:49:48,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c [2025-03-16 20:49:48,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b10954200/95c14186ef5e4496a98521d6d32c606b/FLAG4b5c5764c [2025-03-16 20:49:49,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b10954200/95c14186ef5e4496a98521d6d32c606b [2025-03-16 20:49:49,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:49:49,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:49:49,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:49:49,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:49:49,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:49:49,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:49:49" (1/1) ... [2025-03-16 20:49:49,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aa72034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:49:49, skipping insertion in model container [2025-03-16 20:49:49,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:49:49" (1/1) ... [2025-03-16 20:49:49,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:49:49,439 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.unsafe_arbitrated_fifos_n2d8w8.c[1270,1283] [2025-03-16 20:49:49,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:49:49,680 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:49:49,689 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.unsafe_arbitrated_fifos_n2d8w8.c[1270,1283] [2025-03-16 20:49:49,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:49:49,801 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:49:49,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:49:49 WrapperNode [2025-03-16 20:49:49,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:49:49,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:49:49,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:49:49,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:49:49,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:49:49" (1/1) ... [2025-03-16 20:49:49,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:49:49" (1/1) ... [2025-03-16 20:49:50,020 INFO L138 Inliner]: procedures = 18, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2352 [2025-03-16 20:49:50,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:49:50,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:49:50,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:49:50,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:49:50,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:49:49" (1/1) ... [2025-03-16 20:49:50,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:49:49" (1/1) ... [2025-03-16 20:49:50,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:49:49" (1/1) ... [2025-03-16 20:49:50,169 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 9, 9]. 45 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 4, 4]. [2025-03-16 20:49:50,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:49:49" (1/1) ... [2025-03-16 20:49:50,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:49:49" (1/1) ... [2025-03-16 20:49:50,217 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:49:49" (1/1) ... [2025-03-16 20:49:50,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:49:49" (1/1) ... [2025-03-16 20:49:50,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:49:49" (1/1) ... [2025-03-16 20:49:50,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:49:49" (1/1) ... [2025-03-16 20:49:50,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:49:50,289 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:49:50,290 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:49:50,290 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:49:50,290 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:49:49" (1/1) ... [2025-03-16 20:49:50,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:49:50,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:49:50,314 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-16 20:49:50,319 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-16 20:49:50,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:49:50,333 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 20:49:50,334 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 20:49:50,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:49:50,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 20:49:50,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 20:49:50,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 20:49:50,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 20:49:50,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 20:49:50,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 20:49:50,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:49:50,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:49:50,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 20:49:50,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 20:49:50,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 20:49:50,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 20:49:50,534 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:49:50,536 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:49:52,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L73: call ULTIMATE.dealloc(main_~#state_14~0#1.base, main_~#state_14~0#1.offset);havoc main_~#state_14~0#1.base, main_~#state_14~0#1.offset;call ULTIMATE.dealloc(main_~#state_44~0#1.base, main_~#state_44~0#1.offset);havoc main_~#state_44~0#1.base, main_~#state_44~0#1.offset; [2025-03-16 20:49:52,583 INFO L? ?]: Removed 1271 outVars from TransFormulas that were not future-live. [2025-03-16 20:49:52,583 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:49:52,711 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:49:52,711 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:49:52,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:49:52 BoogieIcfgContainer [2025-03-16 20:49:52,712 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:49:52,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:49:52,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:49:52,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:49:52,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:49:49" (1/3) ... [2025-03-16 20:49:52,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4deec2e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:49:52, skipping insertion in model container [2025-03-16 20:49:52,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:49:49" (2/3) ... [2025-03-16 20:49:52,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4deec2e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:49:52, skipping insertion in model container [2025-03-16 20:49:52,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:49:52" (3/3) ... [2025-03-16 20:49:52,718 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c [2025-03-16 20:49:52,730 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:49:52,731 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c that has 2 procedures, 739 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-03-16 20:49:52,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:49:52,797 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;@46d6bcab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:49:52,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 20:49:52,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 739 states, 731 states have (on average 1.4979480164158687) internal successors, (1095), 732 states have internal predecessors, (1095), 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-16 20:49:52,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-16 20:49:52,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:49:52,820 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] [2025-03-16 20:49:52,821 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:49:52,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:49:52,826 INFO L85 PathProgramCache]: Analyzing trace with hash 666184980, now seen corresponding path program 1 times [2025-03-16 20:49:52,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:49:52,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233464565] [2025-03-16 20:49:52,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:49:52,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:49:52,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-16 20:49:52,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-16 20:49:52,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:49:52,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:49:53,225 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-16 20:49:53,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:49:53,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233464565] [2025-03-16 20:49:53,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233464565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:49:53,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869714853] [2025-03-16 20:49:53,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:49:53,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:49:53,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:49:53,231 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-16 20:49:53,232 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-16 20:49:53,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-16 20:49:53,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-16 20:49:53,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:49:53,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:49:53,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 20:49:53,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:49:53,585 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-16 20:49:53,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:49:53,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869714853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:49:53,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:49:53,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 20:49:53,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91293640] [2025-03-16 20:49:53,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:49:53,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:49:53,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:49:53,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:49:53,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:49:53,610 INFO L87 Difference]: Start difference. First operand has 739 states, 731 states have (on average 1.4979480164158687) internal successors, (1095), 732 states have internal predecessors, (1095), 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 107.0) internal successors, (214), 2 states have internal predecessors, (214), 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-16 20:49:53,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:49:53,832 INFO L93 Difference]: Finished difference Result 1384 states and 2076 transitions. [2025-03-16 20:49:53,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:49:53,834 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 107.0) internal successors, (214), 2 states have internal predecessors, (214), 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 234 [2025-03-16 20:49:53,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:49:53,845 INFO L225 Difference]: With dead ends: 1384 [2025-03-16 20:49:53,847 INFO L226 Difference]: Without dead ends: 736 [2025-03-16 20:49:53,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 235 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-16 20:49:53,853 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:49:53,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 922 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:49:53,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2025-03-16 20:49:53,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2025-03-16 20:49:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 729 states have (on average 1.49519890260631) internal successors, (1090), 729 states have internal predecessors, (1090), 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-16 20:49:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1100 transitions. [2025-03-16 20:49:53,903 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1100 transitions. Word has length 234 [2025-03-16 20:49:53,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:49:53,903 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 1100 transitions. [2025-03-16 20:49:53,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 107.0) internal successors, (214), 2 states have internal predecessors, (214), 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-16 20:49:53,904 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1100 transitions. [2025-03-16 20:49:53,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-16 20:49:53,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:49:53,910 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] [2025-03-16 20:49:53,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 20:49:54,111 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-16 20:49:54,111 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:49:54,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:49:54,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1662182511, now seen corresponding path program 1 times [2025-03-16 20:49:54,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:49:54,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317586311] [2025-03-16 20:49:54,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:49:54,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:49:54,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-16 20:49:54,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-16 20:49:54,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:49:54,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:49:54,616 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-16 20:49:54,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:49:54,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317586311] [2025-03-16 20:49:54,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317586311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:49:54,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:49:54,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:49:54,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902780956] [2025-03-16 20:49:54,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:49:54,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:49:54,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:49:54,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:49:54,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:49:54,620 INFO L87 Difference]: Start difference. First operand 736 states and 1100 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-16 20:49:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:49:54,894 INFO L93 Difference]: Finished difference Result 1471 states and 2199 transitions. [2025-03-16 20:49:54,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:49:54,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 234 [2025-03-16 20:49:54,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:49:54,898 INFO L225 Difference]: With dead ends: 1471 [2025-03-16 20:49:54,898 INFO L226 Difference]: Without dead ends: 741 [2025-03-16 20:49:54,900 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-16 20:49:54,900 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 6 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:49:54,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1838 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:49:54,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2025-03-16 20:49:54,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 737. [2025-03-16 20:49:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 730 states have (on average 1.4945205479452055) internal successors, (1091), 730 states have internal predecessors, (1091), 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-16 20:49:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1101 transitions. [2025-03-16 20:49:54,929 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1101 transitions. Word has length 234 [2025-03-16 20:49:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:49:54,929 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1101 transitions. [2025-03-16 20:49:54,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-16 20:49:54,930 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1101 transitions. [2025-03-16 20:49:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-16 20:49:54,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:49:54,932 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] [2025-03-16 20:49:54,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:49:54,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:49:54,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:49:54,933 INFO L85 PathProgramCache]: Analyzing trace with hash 895224173, now seen corresponding path program 1 times [2025-03-16 20:49:54,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:49:54,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41512376] [2025-03-16 20:49:54,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:49:54,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:49:54,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-16 20:49:55,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-16 20:49:55,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:49:55,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:49:55,377 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-16 20:49:55,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:49:55,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41512376] [2025-03-16 20:49:55,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41512376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:49:55,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473805652] [2025-03-16 20:49:55,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:49:55,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:49:55,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:49:55,380 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-16 20:49:55,381 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-16 20:49:55,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-16 20:49:55,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-16 20:49:55,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:49:55,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:49:55,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 1079 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 20:49:55,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:49:55,730 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-16 20:49:55,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:49:55,778 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-16 20:49:55,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473805652] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 20:49:55,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 20:49:55,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2025-03-16 20:49:55,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821702565] [2025-03-16 20:49:55,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:49:55,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:49:55,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:49:55,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:49:55,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:49:55,780 INFO L87 Difference]: Start difference. First operand 737 states and 1101 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-16 20:49:56,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:49:56,030 INFO L93 Difference]: Finished difference Result 1447 states and 2162 transitions. [2025-03-16 20:49:56,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:49:56,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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 237 [2025-03-16 20:49:56,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:49:56,033 INFO L225 Difference]: With dead ends: 1447 [2025-03-16 20:49:56,035 INFO L226 Difference]: Without dead ends: 738 [2025-03-16 20:49:56,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 472 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-16 20:49:56,036 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 6 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:49:56,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1833 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:49:56,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-03-16 20:49:56,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2025-03-16 20:49:56,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 731 states have (on average 1.493844049247606) internal successors, (1092), 731 states have internal predecessors, (1092), 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-16 20:49:56,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1102 transitions. [2025-03-16 20:49:56,051 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1102 transitions. Word has length 237 [2025-03-16 20:49:56,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:49:56,051 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1102 transitions. [2025-03-16 20:49:56,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-16 20:49:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1102 transitions. [2025-03-16 20:49:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-16 20:49:56,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:49:56,054 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] [2025-03-16 20:49:56,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 20:49:56,254 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-16 20:49:56,254 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:49:56,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:49:56,255 INFO L85 PathProgramCache]: Analyzing trace with hash 300986592, now seen corresponding path program 1 times [2025-03-16 20:49:56,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:49:56,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551537316] [2025-03-16 20:49:56,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:49:56,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:49:56,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-16 20:49:56,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-16 20:49:56,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:49:56,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:49:56,587 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-16 20:49:56,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:49:56,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551537316] [2025-03-16 20:49:56,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551537316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:49:56,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034585914] [2025-03-16 20:49:56,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:49:56,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:49:56,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:49:56,591 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-16 20:49:56,592 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-16 20:49:56,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-16 20:49:56,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-16 20:49:56,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:49:56,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:49:56,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:49:56,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:49:57,021 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-16 20:49:57,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:49:57,630 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-16 20:49:57,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034585914] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:49:57,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:49:57,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 8] total 12 [2025-03-16 20:49:57,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600212430] [2025-03-16 20:49:57,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:49:57,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 20:49:57,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:49:57,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 20:49:57,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:49:57,632 INFO L87 Difference]: Start difference. First operand 738 states and 1102 transitions. Second operand has 12 states, 12 states have (on average 28.833333333333332) internal successors, (346), 12 states have internal predecessors, (346), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 20:49:59,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:49:59,493 INFO L93 Difference]: Finished difference Result 2083 states and 3112 transitions. [2025-03-16 20:49:59,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:49:59,494 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 28.833333333333332) internal successors, (346), 12 states have internal predecessors, (346), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 240 [2025-03-16 20:49:59,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:49:59,498 INFO L225 Difference]: With dead ends: 2083 [2025-03-16 20:49:59,498 INFO L226 Difference]: Without dead ends: 1352 [2025-03-16 20:49:59,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 472 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-16 20:49:59,499 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 3733 mSDsluCounter, 4700 mSDsCounter, 0 mSdLazyCounter, 3426 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3738 SdHoareTripleChecker+Valid, 5382 SdHoareTripleChecker+Invalid, 3433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:49:59,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3738 Valid, 5382 Invalid, 3433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3426 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 20:49:59,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-03-16 20:49:59,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 954. [2025-03-16 20:49:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 942 states have (on average 1.4904458598726114) internal successors, (1404), 942 states have internal predecessors, (1404), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 20:49:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1424 transitions. [2025-03-16 20:49:59,520 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1424 transitions. Word has length 240 [2025-03-16 20:49:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:49:59,521 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1424 transitions. [2025-03-16 20:49:59,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 28.833333333333332) internal successors, (346), 12 states have internal predecessors, (346), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 20:49:59,521 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1424 transitions. [2025-03-16 20:49:59,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-16 20:49:59,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:49:59,523 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] [2025-03-16 20:49:59,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 20:49:59,728 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-16 20:49:59,728 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:49:59,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:49:59,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1140617301, now seen corresponding path program 1 times [2025-03-16 20:49:59,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:49:59,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314022393] [2025-03-16 20:49:59,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:49:59,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:49:59,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-16 20:49:59,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-16 20:49:59,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:49:59,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:00,070 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-16 20:50:00,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:00,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314022393] [2025-03-16 20:50:00,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314022393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:00,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816225933] [2025-03-16 20:50:00,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:00,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:00,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:00,073 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-16 20:50:00,074 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-16 20:50:00,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-16 20:50:00,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-16 20:50:00,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:00,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:00,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 20:50:00,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:50:00,415 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-16 20:50:00,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:50:00,481 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-16 20:50:00,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816225933] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:50:00,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:50:00,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 4] total 9 [2025-03-16 20:50:00,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999298868] [2025-03-16 20:50:00,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:50:00,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:50:00,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:00,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:50:00,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:50:00,483 INFO L87 Difference]: Start difference. First operand 954 states and 1424 transitions. Second operand has 9 states, 9 states have (on average 27.555555555555557) internal successors, (248), 9 states have internal predecessors, (248), 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-16 20:50:00,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:00,898 INFO L93 Difference]: Finished difference Result 1935 states and 2893 transitions. [2025-03-16 20:50:00,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:50:00,898 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.555555555555557) internal successors, (248), 9 states have internal predecessors, (248), 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 244 [2025-03-16 20:50:00,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:00,901 INFO L225 Difference]: With dead ends: 1935 [2025-03-16 20:50:00,901 INFO L226 Difference]: Without dead ends: 993 [2025-03-16 20:50:00,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 484 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-16 20:50:00,903 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 54 mSDsluCounter, 3686 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4612 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:00,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4612 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:50:00,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2025-03-16 20:50:00,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 989. [2025-03-16 20:50:00,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 977 states have (on average 1.4872057318321392) internal successors, (1453), 977 states have internal predecessors, (1453), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 20:50:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1473 transitions. [2025-03-16 20:50:00,922 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1473 transitions. Word has length 244 [2025-03-16 20:50:00,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:00,922 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1473 transitions. [2025-03-16 20:50:00,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.555555555555557) internal successors, (248), 9 states have internal predecessors, (248), 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-16 20:50:00,922 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1473 transitions. [2025-03-16 20:50:00,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-16 20:50:00,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:00,924 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] [2025-03-16 20:50:00,933 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-16 20:50:01,129 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-16 20:50:01,129 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:01,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:01,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1828155098, now seen corresponding path program 2 times [2025-03-16 20:50:01,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:01,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761361715] [2025-03-16 20:50:01,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 20:50:01,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:01,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 256 statements into 2 equivalence classes. [2025-03-16 20:50:01,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 171 of 256 statements. [2025-03-16 20:50:01,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 20:50:01,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:01,590 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-16 20:50:01,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:01,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761361715] [2025-03-16 20:50:01,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761361715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:01,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:01,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:01,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750767210] [2025-03-16 20:50:01,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:01,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:01,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:01,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:01,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:01,593 INFO L87 Difference]: Start difference. First operand 989 states and 1473 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 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-16 20:50:01,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:01,845 INFO L93 Difference]: Finished difference Result 993 states and 1477 transitions. [2025-03-16 20:50:01,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:01,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 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 256 [2025-03-16 20:50:01,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:01,848 INFO L225 Difference]: With dead ends: 993 [2025-03-16 20:50:01,849 INFO L226 Difference]: Without dead ends: 991 [2025-03-16 20:50:01,849 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-16 20:50:01,849 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 0 mSDsluCounter, 1835 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2755 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:01,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2755 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:01,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2025-03-16 20:50:01,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2025-03-16 20:50:01,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 979 states have (on average 1.4862104187946885) internal successors, (1455), 979 states have internal predecessors, (1455), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 20:50:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1475 transitions. [2025-03-16 20:50:01,869 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1475 transitions. Word has length 256 [2025-03-16 20:50:01,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:01,871 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1475 transitions. [2025-03-16 20:50:01,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 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-16 20:50:01,871 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1475 transitions. [2025-03-16 20:50:01,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-16 20:50:01,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:01,874 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] [2025-03-16 20:50:01,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:50:01,874 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:01,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:01,874 INFO L85 PathProgramCache]: Analyzing trace with hash -833553497, now seen corresponding path program 1 times [2025-03-16 20:50:01,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:01,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419916652] [2025-03-16 20:50:01,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:01,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:01,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-16 20:50:01,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-16 20:50:01,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:01,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:02,192 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-16 20:50:02,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:02,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419916652] [2025-03-16 20:50:02,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419916652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:02,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325317412] [2025-03-16 20:50:02,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:02,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:02,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:02,197 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-16 20:50:02,199 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-16 20:50:02,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-16 20:50:02,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-16 20:50:02,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:02,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:02,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 1145 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 20:50:02,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:50:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-16 20:50:02,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:50:02,838 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 20:50:02,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325317412] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:50:02,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:50:02,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 10] total 15 [2025-03-16 20:50:02,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119473507] [2025-03-16 20:50:02,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:50:02,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 20:50:02,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:02,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 20:50:02,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:50:02,842 INFO L87 Difference]: Start difference. First operand 991 states and 1475 transitions. Second operand has 15 states, 15 states have (on average 16.866666666666667) internal successors, (253), 15 states have internal predecessors, (253), 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-16 20:50:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:03,577 INFO L93 Difference]: Finished difference Result 1990 states and 2966 transitions. [2025-03-16 20:50:03,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:50:03,577 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 16.866666666666667) internal successors, (253), 15 states have internal predecessors, (253), 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 257 [2025-03-16 20:50:03,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:03,581 INFO L225 Difference]: With dead ends: 1990 [2025-03-16 20:50:03,581 INFO L226 Difference]: Without dead ends: 1016 [2025-03-16 20:50:03,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-03-16 20:50:03,583 INFO L435 NwaCegarLoop]: 932 mSDtfsCounter, 86 mSDsluCounter, 7428 mSDsCounter, 0 mSdLazyCounter, 1729 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 8360 SdHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:03,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 8360 Invalid, 1731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1729 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:50:03,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-03-16 20:50:03,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2025-03-16 20:50:03,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1004 states have (on average 1.4840637450199203) internal successors, (1490), 1004 states have internal predecessors, (1490), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 20:50:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1510 transitions. [2025-03-16 20:50:03,603 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1510 transitions. Word has length 257 [2025-03-16 20:50:03,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:03,603 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1510 transitions. [2025-03-16 20:50:03,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 16.866666666666667) internal successors, (253), 15 states have internal predecessors, (253), 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-16 20:50:03,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1510 transitions. [2025-03-16 20:50:03,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-16 20:50:03,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:03,606 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 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] [2025-03-16 20:50:03,615 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-16 20:50:03,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:03,807 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:03,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:03,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1202550633, now seen corresponding path program 2 times [2025-03-16 20:50:03,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:03,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747874145] [2025-03-16 20:50:03,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 20:50:03,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:03,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 272 statements into 2 equivalence classes. [2025-03-16 20:50:03,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 172 of 272 statements. [2025-03-16 20:50:03,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 20:50:03,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-16 20:50:04,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:04,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747874145] [2025-03-16 20:50:04,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747874145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:04,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:04,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:50:04,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343360304] [2025-03-16 20:50:04,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:04,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:50:04,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:04,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:50:04,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:04,055 INFO L87 Difference]: Start difference. First operand 1016 states and 1510 transitions. Second operand has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 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-16 20:50:04,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:04,541 INFO L93 Difference]: Finished difference Result 1665 states and 2478 transitions. [2025-03-16 20:50:04,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:04,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 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 272 [2025-03-16 20:50:04,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:04,545 INFO L225 Difference]: With dead ends: 1665 [2025-03-16 20:50:04,545 INFO L226 Difference]: Without dead ends: 1018 [2025-03-16 20:50:04,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:04,546 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 0 mSDsluCounter, 2519 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3439 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:04,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3439 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:50:04,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2025-03-16 20:50:04,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2025-03-16 20:50:04,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1006 states have (on average 1.4831013916500995) internal successors, (1492), 1006 states have internal predecessors, (1492), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 20:50:04,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1512 transitions. [2025-03-16 20:50:04,562 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1512 transitions. Word has length 272 [2025-03-16 20:50:04,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:04,562 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1512 transitions. [2025-03-16 20:50:04,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 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-16 20:50:04,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1512 transitions. [2025-03-16 20:50:04,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-16 20:50:04,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:04,564 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 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] [2025-03-16 20:50:04,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:50:04,564 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:04,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:04,565 INFO L85 PathProgramCache]: Analyzing trace with hash 555873727, now seen corresponding path program 1 times [2025-03-16 20:50:04,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:04,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492133276] [2025-03-16 20:50:04,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:04,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:04,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-16 20:50:04,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-16 20:50:04,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:04,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:04,907 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-16 20:50:04,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:04,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492133276] [2025-03-16 20:50:04,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492133276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:04,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086949676] [2025-03-16 20:50:04,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:04,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:04,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:04,910 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-16 20:50:04,911 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-16 20:50:05,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-16 20:50:05,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-16 20:50:05,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:05,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:05,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-16 20:50:05,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:50:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-16 20:50:05,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:50:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-16 20:50:05,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086949676] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:50:05,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:50:05,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 7] total 18 [2025-03-16 20:50:05,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893233803] [2025-03-16 20:50:05,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:50:05,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 20:50:05,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:05,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 20:50:05,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-03-16 20:50:05,551 INFO L87 Difference]: Start difference. First operand 1018 states and 1512 transitions. Second operand has 18 states, 18 states have (on average 14.61111111111111) internal successors, (263), 18 states have internal predecessors, (263), 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-16 20:50:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:06,292 INFO L93 Difference]: Finished difference Result 1975 states and 2944 transitions. [2025-03-16 20:50:06,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 20:50:06,292 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 14.61111111111111) internal successors, (263), 18 states have internal predecessors, (263), 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 273 [2025-03-16 20:50:06,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:06,295 INFO L225 Difference]: With dead ends: 1975 [2025-03-16 20:50:06,295 INFO L226 Difference]: Without dead ends: 1058 [2025-03-16 20:50:06,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 535 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-16 20:50:06,297 INFO L435 NwaCegarLoop]: 950 mSDtfsCounter, 136 mSDsluCounter, 9447 mSDsCounter, 0 mSdLazyCounter, 2270 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 10397 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:06,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 10397 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2270 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 20:50:06,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2025-03-16 20:50:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1058. [2025-03-16 20:50:06,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 1046 states have (on average 1.479923518164436) internal successors, (1548), 1046 states have internal predecessors, (1548), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 20:50:06,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1568 transitions. [2025-03-16 20:50:06,314 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1568 transitions. Word has length 273 [2025-03-16 20:50:06,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:06,314 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1568 transitions. [2025-03-16 20:50:06,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.61111111111111) internal successors, (263), 18 states have internal predecessors, (263), 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-16 20:50:06,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1568 transitions. [2025-03-16 20:50:06,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-03-16 20:50:06,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:06,316 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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] [2025-03-16 20:50:06,326 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-16 20:50:06,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:06,517 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:06,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:06,518 INFO L85 PathProgramCache]: Analyzing trace with hash -959116673, now seen corresponding path program 2 times [2025-03-16 20:50:06,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:06,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771718310] [2025-03-16 20:50:06,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 20:50:06,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:06,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 285 statements into 2 equivalence classes. [2025-03-16 20:50:06,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 173 of 285 statements. [2025-03-16 20:50:06,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 20:50:06,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:06,817 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-16 20:50:06,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:06,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771718310] [2025-03-16 20:50:06,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771718310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:06,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:06,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:06,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507605285] [2025-03-16 20:50:06,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:06,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:06,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:06,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:06,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:06,819 INFO L87 Difference]: Start difference. First operand 1058 states and 1568 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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-16 20:50:07,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:07,169 INFO L93 Difference]: Finished difference Result 1713 states and 2543 transitions. [2025-03-16 20:50:07,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:07,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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 285 [2025-03-16 20:50:07,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:07,172 INFO L225 Difference]: With dead ends: 1713 [2025-03-16 20:50:07,172 INFO L226 Difference]: Without dead ends: 1058 [2025-03-16 20:50:07,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:07,173 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 974 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:07,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 1681 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:50:07,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2025-03-16 20:50:07,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1058. [2025-03-16 20:50:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 1046 states have (on average 1.4780114722753346) internal successors, (1546), 1046 states have internal predecessors, (1546), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 20:50:07,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1566 transitions. [2025-03-16 20:50:07,190 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1566 transitions. Word has length 285 [2025-03-16 20:50:07,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:07,190 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1566 transitions. [2025-03-16 20:50:07,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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-16 20:50:07,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1566 transitions. [2025-03-16 20:50:07,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-16 20:50:07,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:07,192 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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] [2025-03-16 20:50:07,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:50:07,192 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:07,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:07,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1492704480, now seen corresponding path program 1 times [2025-03-16 20:50:07,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:07,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067751586] [2025-03-16 20:50:07,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:07,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:07,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-16 20:50:07,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-16 20:50:07,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:07,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:07,597 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-16 20:50:07,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:07,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067751586] [2025-03-16 20:50:07,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067751586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:07,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:07,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:50:07,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194252301] [2025-03-16 20:50:07,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:07,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:50:07,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:07,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:50:07,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:07,600 INFO L87 Difference]: Start difference. First operand 1058 states and 1566 transitions. Second operand has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 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-16 20:50:07,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:07,913 INFO L93 Difference]: Finished difference Result 1707 states and 2532 transitions. [2025-03-16 20:50:07,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:07,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 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 286 [2025-03-16 20:50:07,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:07,916 INFO L225 Difference]: With dead ends: 1707 [2025-03-16 20:50:07,916 INFO L226 Difference]: Without dead ends: 1058 [2025-03-16 20:50:07,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:50:07,917 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 2014 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2019 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:07,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2019 Valid, 1681 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:50:07,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2025-03-16 20:50:07,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1058. [2025-03-16 20:50:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 1046 states have (on average 1.477055449330784) internal successors, (1545), 1046 states have internal predecessors, (1545), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 20:50:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1565 transitions. [2025-03-16 20:50:07,933 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1565 transitions. Word has length 286 [2025-03-16 20:50:07,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:07,934 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1565 transitions. [2025-03-16 20:50:07,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 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-16 20:50:07,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1565 transitions. [2025-03-16 20:50:07,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-16 20:50:07,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:07,936 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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] [2025-03-16 20:50:07,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:50:07,936 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:07,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:07,937 INFO L85 PathProgramCache]: Analyzing trace with hash -432388159, now seen corresponding path program 1 times [2025-03-16 20:50:07,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:07,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192950341] [2025-03-16 20:50:07,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:07,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:07,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-16 20:50:08,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-16 20:50:08,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:08,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-16 20:50:08,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:08,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192950341] [2025-03-16 20:50:08,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192950341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:08,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:08,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:50:08,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746188947] [2025-03-16 20:50:08,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:08,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:50:08,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:08,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:50:08,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:08,376 INFO L87 Difference]: Start difference. First operand 1058 states and 1565 transitions. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 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-16 20:50:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:08,722 INFO L93 Difference]: Finished difference Result 1713 states and 2538 transitions. [2025-03-16 20:50:08,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:08,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 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 287 [2025-03-16 20:50:08,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:08,725 INFO L225 Difference]: With dead ends: 1713 [2025-03-16 20:50:08,725 INFO L226 Difference]: Without dead ends: 1058 [2025-03-16 20:50:08,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:50:08,726 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 2050 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2055 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:08,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2055 Valid, 1681 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:50:08,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2025-03-16 20:50:08,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1058. [2025-03-16 20:50:08,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 1046 states have (on average 1.4751434034416826) internal successors, (1543), 1046 states have internal predecessors, (1543), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 20:50:08,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1563 transitions. [2025-03-16 20:50:08,742 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1563 transitions. Word has length 287 [2025-03-16 20:50:08,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:08,743 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1563 transitions. [2025-03-16 20:50:08,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 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-16 20:50:08,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1563 transitions. [2025-03-16 20:50:08,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-03-16 20:50:08,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:08,744 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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] [2025-03-16 20:50:08,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:50:08,745 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:08,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:08,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1779769380, now seen corresponding path program 1 times [2025-03-16 20:50:08,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:08,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246684689] [2025-03-16 20:50:08,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:08,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:08,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-03-16 20:50:08,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-03-16 20:50:08,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:08,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-16 20:50:09,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:09,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246684689] [2025-03-16 20:50:09,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246684689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:09,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:09,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:09,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664863692] [2025-03-16 20:50:09,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:09,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:09,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:09,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:09,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:09,303 INFO L87 Difference]: Start difference. First operand 1058 states and 1563 transitions. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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-16 20:50:09,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:09,664 INFO L93 Difference]: Finished difference Result 1707 states and 2527 transitions. [2025-03-16 20:50:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:09,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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 288 [2025-03-16 20:50:09,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:09,667 INFO L225 Difference]: With dead ends: 1707 [2025-03-16 20:50:09,667 INFO L226 Difference]: Without dead ends: 1058 [2025-03-16 20:50:09,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:09,669 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 947 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:09,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 1681 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:50:09,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2025-03-16 20:50:09,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1058. [2025-03-16 20:50:09,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 1046 states have (on average 1.474187380497132) internal successors, (1542), 1046 states have internal predecessors, (1542), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 20:50:09,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1562 transitions. [2025-03-16 20:50:09,686 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1562 transitions. Word has length 288 [2025-03-16 20:50:09,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:09,687 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1562 transitions. [2025-03-16 20:50:09,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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-16 20:50:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1562 transitions. [2025-03-16 20:50:09,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-03-16 20:50:09,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:09,688 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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] [2025-03-16 20:50:09,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:50:09,689 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:09,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:09,689 INFO L85 PathProgramCache]: Analyzing trace with hash -111874967, now seen corresponding path program 1 times [2025-03-16 20:50:09,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:09,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206295192] [2025-03-16 20:50:09,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:09,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:09,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-16 20:50:09,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-16 20:50:09,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:09,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:10,708 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-16 20:50:10,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:10,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206295192] [2025-03-16 20:50:10,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206295192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:10,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:10,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:50:10,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558580142] [2025-03-16 20:50:10,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:10,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:50:10,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:10,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:50:10,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:50:10,710 INFO L87 Difference]: Start difference. First operand 1058 states and 1562 transitions. Second operand has 10 states, 10 states have (on average 22.5) internal successors, (225), 10 states have internal predecessors, (225), 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-16 20:50:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:12,024 INFO L93 Difference]: Finished difference Result 2378 states and 3520 transitions. [2025-03-16 20:50:12,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 20:50:12,024 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 22.5) internal successors, (225), 10 states have internal predecessors, (225), 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 289 [2025-03-16 20:50:12,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:12,027 INFO L225 Difference]: With dead ends: 2378 [2025-03-16 20:50:12,027 INFO L226 Difference]: Without dead ends: 1090 [2025-03-16 20:50:12,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-16 20:50:12,029 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 760 mSDsluCounter, 11124 mSDsCounter, 0 mSdLazyCounter, 3294 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 12619 SdHoareTripleChecker+Invalid, 3343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:12,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 12619 Invalid, 3343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3294 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 20:50:12,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2025-03-16 20:50:12,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1082. [2025-03-16 20:50:12,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 1070 states have (on average 1.4747663551401868) internal successors, (1578), 1070 states have internal predecessors, (1578), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 20:50:12,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1598 transitions. [2025-03-16 20:50:12,047 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1598 transitions. Word has length 289 [2025-03-16 20:50:12,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:12,048 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1598 transitions. [2025-03-16 20:50:12,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.5) internal successors, (225), 10 states have internal predecessors, (225), 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-16 20:50:12,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1598 transitions. [2025-03-16 20:50:12,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-03-16 20:50:12,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:12,050 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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] [2025-03-16 20:50:12,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:50:12,050 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:12,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:12,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1568744621, now seen corresponding path program 1 times [2025-03-16 20:50:12,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:12,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219386605] [2025-03-16 20:50:12,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:12,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:12,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-16 20:50:12,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-16 20:50:12,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:12,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-16 20:50:12,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:12,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219386605] [2025-03-16 20:50:12,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219386605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:12,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:12,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:50:12,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019436329] [2025-03-16 20:50:12,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:12,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:50:12,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:12,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:50:12,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:12,777 INFO L87 Difference]: Start difference. First operand 1082 states and 1598 transitions. Second operand has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 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-16 20:50:13,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:13,066 INFO L93 Difference]: Finished difference Result 1899 states and 2811 transitions. [2025-03-16 20:50:13,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:50:13,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 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 290 [2025-03-16 20:50:13,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:13,070 INFO L225 Difference]: With dead ends: 1899 [2025-03-16 20:50:13,070 INFO L226 Difference]: Without dead ends: 1238 [2025-03-16 20:50:13,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:13,072 INFO L435 NwaCegarLoop]: 913 mSDtfsCounter, 150 mSDsluCounter, 2731 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 3644 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:13,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 3644 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:50:13,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2025-03-16 20:50:13,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1236. [2025-03-16 20:50:13,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 1224 states have (on average 1.4754901960784315) internal successors, (1806), 1224 states have internal predecessors, (1806), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 20:50:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1826 transitions. [2025-03-16 20:50:13,111 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1826 transitions. Word has length 290 [2025-03-16 20:50:13,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:13,112 INFO L471 AbstractCegarLoop]: Abstraction has 1236 states and 1826 transitions. [2025-03-16 20:50:13,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 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-16 20:50:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1826 transitions. [2025-03-16 20:50:13,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-03-16 20:50:13,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:13,114 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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] [2025-03-16 20:50:13,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:50:13,114 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:13,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:13,115 INFO L85 PathProgramCache]: Analyzing trace with hash 221093707, now seen corresponding path program 1 times [2025-03-16 20:50:13,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:13,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006756326] [2025-03-16 20:50:13,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:13,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:13,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-16 20:50:13,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-16 20:50:13,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:13,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-16 20:50:13,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:13,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006756326] [2025-03-16 20:50:13,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006756326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:13,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:13,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:50:13,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67239799] [2025-03-16 20:50:13,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:13,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:50:13,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:13,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:50:13,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:50:13,609 INFO L87 Difference]: Start difference. First operand 1236 states and 1826 transitions. Second operand has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 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-16 20:50:13,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:13,915 INFO L93 Difference]: Finished difference Result 2123 states and 3138 transitions. [2025-03-16 20:50:13,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:50:13,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 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 291 [2025-03-16 20:50:13,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:13,919 INFO L225 Difference]: With dead ends: 2123 [2025-03-16 20:50:13,919 INFO L226 Difference]: Without dead ends: 1308 [2025-03-16 20:50:13,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:50:13,920 INFO L435 NwaCegarLoop]: 915 mSDtfsCounter, 39 mSDsluCounter, 3645 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 4560 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:13,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 4560 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:50:13,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2025-03-16 20:50:13,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1308. [2025-03-16 20:50:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 1296 states have (on average 1.4722222222222223) internal successors, (1908), 1296 states have internal predecessors, (1908), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 20:50:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1928 transitions. [2025-03-16 20:50:13,939 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1928 transitions. Word has length 291 [2025-03-16 20:50:13,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:13,939 INFO L471 AbstractCegarLoop]: Abstraction has 1308 states and 1928 transitions. [2025-03-16 20:50:13,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 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-16 20:50:13,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1928 transitions. [2025-03-16 20:50:13,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-03-16 20:50:13,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:13,942 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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] [2025-03-16 20:50:13,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:50:13,942 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:13,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:13,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1020161248, now seen corresponding path program 1 times [2025-03-16 20:50:13,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:13,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905646846] [2025-03-16 20:50:13,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:13,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:13,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-16 20:50:14,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-16 20:50:14,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:14,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-16 20:50:14,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:14,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905646846] [2025-03-16 20:50:14,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905646846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:14,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:14,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:50:14,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900219026] [2025-03-16 20:50:14,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:14,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:50:14,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:14,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:50:14,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:50:14,362 INFO L87 Difference]: Start difference. First operand 1308 states and 1928 transitions. Second operand has 7 states, 7 states have (on average 32.42857142857143) internal successors, (227), 7 states have internal predecessors, (227), 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-16 20:50:15,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:15,273 INFO L93 Difference]: Finished difference Result 3196 states and 4720 transitions. [2025-03-16 20:50:15,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:50:15,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.42857142857143) internal successors, (227), 7 states have internal predecessors, (227), 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 291 [2025-03-16 20:50:15,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:15,277 INFO L225 Difference]: With dead ends: 3196 [2025-03-16 20:50:15,277 INFO L226 Difference]: Without dead ends: 1316 [2025-03-16 20:50:15,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-16 20:50:15,279 INFO L435 NwaCegarLoop]: 1435 mSDtfsCounter, 1803 mSDsluCounter, 4981 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1807 SdHoareTripleChecker+Valid, 6416 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:15,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1807 Valid, 6416 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 20:50:15,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2025-03-16 20:50:15,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1312. [2025-03-16 20:50:15,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1300 states have (on average 1.4692307692307693) internal successors, (1910), 1300 states have internal predecessors, (1910), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 20:50:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1930 transitions. [2025-03-16 20:50:15,304 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1930 transitions. Word has length 291 [2025-03-16 20:50:15,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:15,304 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 1930 transitions. [2025-03-16 20:50:15,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.42857142857143) internal successors, (227), 7 states have internal predecessors, (227), 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-16 20:50:15,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1930 transitions. [2025-03-16 20:50:15,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-16 20:50:15,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:15,307 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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] [2025-03-16 20:50:15,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:50:15,307 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:15,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:15,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1569305361, now seen corresponding path program 1 times [2025-03-16 20:50:15,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:15,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694353575] [2025-03-16 20:50:15,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:15,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:15,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-16 20:50:15,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-16 20:50:15,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:15,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:15,809 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-16 20:50:15,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:15,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694353575] [2025-03-16 20:50:15,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694353575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:15,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:15,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:50:15,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355293633] [2025-03-16 20:50:15,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:15,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:50:15,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:15,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:50:15,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:50:15,811 INFO L87 Difference]: Start difference. First operand 1312 states and 1930 transitions. Second operand has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 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-16 20:50:16,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:16,557 INFO L93 Difference]: Finished difference Result 2249 states and 3311 transitions. [2025-03-16 20:50:16,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:50:16,557 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 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 292 [2025-03-16 20:50:16,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:16,561 INFO L225 Difference]: With dead ends: 2249 [2025-03-16 20:50:16,561 INFO L226 Difference]: Without dead ends: 1320 [2025-03-16 20:50:16,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:50:16,562 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 1053 mSDsluCounter, 2003 mSDsCounter, 0 mSdLazyCounter, 1716 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:16,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 2672 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1716 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 20:50:16,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-03-16 20:50:16,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1316. [2025-03-16 20:50:16,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1304 states have (on average 1.4662576687116564) internal successors, (1912), 1304 states have internal predecessors, (1912), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 20:50:16,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1932 transitions. [2025-03-16 20:50:16,587 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1932 transitions. Word has length 292 [2025-03-16 20:50:16,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:16,588 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1932 transitions. [2025-03-16 20:50:16,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 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-16 20:50:16,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1932 transitions. [2025-03-16 20:50:16,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-16 20:50:16,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:16,590 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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] [2025-03-16 20:50:16,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:50:16,590 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:16,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:16,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2095683323, now seen corresponding path program 1 times [2025-03-16 20:50:16,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:16,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194297737] [2025-03-16 20:50:16,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:16,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:16,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-16 20:50:16,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-16 20:50:16,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:16,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:17,078 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-16 20:50:17,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:17,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194297737] [2025-03-16 20:50:17,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194297737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:17,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:17,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:50:17,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706690229] [2025-03-16 20:50:17,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:17,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:50:17,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:17,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:50:17,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:50:17,080 INFO L87 Difference]: Start difference. First operand 1316 states and 1932 transitions. Second operand has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 states have internal predecessors, (229), 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-16 20:50:17,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:17,978 INFO L93 Difference]: Finished difference Result 2753 states and 4056 transitions. [2025-03-16 20:50:17,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:50:17,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 states have internal predecessors, (229), 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 293 [2025-03-16 20:50:17,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:17,983 INFO L225 Difference]: With dead ends: 2753 [2025-03-16 20:50:17,983 INFO L226 Difference]: Without dead ends: 1888 [2025-03-16 20:50:17,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:50:17,984 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 1844 mSDsluCounter, 1998 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1849 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:17,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1849 Valid, 2672 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1703 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 20:50:17,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2025-03-16 20:50:18,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1318. [2025-03-16 20:50:18,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1306 states have (on average 1.4655436447166923) internal successors, (1914), 1306 states have internal predecessors, (1914), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 20:50:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1934 transitions. [2025-03-16 20:50:18,004 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1934 transitions. Word has length 293 [2025-03-16 20:50:18,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:18,004 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1934 transitions. [2025-03-16 20:50:18,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 states have internal predecessors, (229), 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-16 20:50:18,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1934 transitions. [2025-03-16 20:50:18,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-16 20:50:18,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:18,006 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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] [2025-03-16 20:50:18,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:50:18,006 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:18,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:18,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1286323134, now seen corresponding path program 1 times [2025-03-16 20:50:18,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:18,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687057257] [2025-03-16 20:50:18,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:18,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:18,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-16 20:50:18,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-16 20:50:18,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:18,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-16 20:50:18,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:18,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687057257] [2025-03-16 20:50:18,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687057257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:18,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:18,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:50:18,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479965850] [2025-03-16 20:50:18,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:18,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:50:18,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:18,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:50:18,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:50:18,944 INFO L87 Difference]: Start difference. First operand 1318 states and 1934 transitions. Second operand has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 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-16 20:50:19,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:19,359 INFO L93 Difference]: Finished difference Result 2325 states and 3415 transitions. [2025-03-16 20:50:19,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:50:19,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 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 293 [2025-03-16 20:50:19,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:19,364 INFO L225 Difference]: With dead ends: 2325 [2025-03-16 20:50:19,364 INFO L226 Difference]: Without dead ends: 1334 [2025-03-16 20:50:19,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:50:19,365 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 1016 mSDsluCounter, 3535 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:19,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 4433 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:50:19,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2025-03-16 20:50:19,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1328. [2025-03-16 20:50:19,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1316 states have (on average 1.4635258358662615) internal successors, (1926), 1316 states have internal predecessors, (1926), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 20:50:19,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1946 transitions. [2025-03-16 20:50:19,382 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1946 transitions. Word has length 293 [2025-03-16 20:50:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:19,382 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 1946 transitions. [2025-03-16 20:50:19,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 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-16 20:50:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1946 transitions. [2025-03-16 20:50:19,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-16 20:50:19,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:19,384 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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] [2025-03-16 20:50:19,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 20:50:19,384 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:19,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:19,385 INFO L85 PathProgramCache]: Analyzing trace with hash 33909584, now seen corresponding path program 1 times [2025-03-16 20:50:19,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:19,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227615920] [2025-03-16 20:50:19,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:19,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:19,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-16 20:50:19,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-16 20:50:19,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:19,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:19,672 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-16 20:50:19,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:19,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227615920] [2025-03-16 20:50:19,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227615920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:19,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:19,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:50:19,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905987324] [2025-03-16 20:50:19,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:19,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:50:19,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:19,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:50:19,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:50:19,674 INFO L87 Difference]: Start difference. First operand 1328 states and 1946 transitions. Second operand has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 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-16 20:50:20,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:20,270 INFO L93 Difference]: Finished difference Result 2324 states and 3409 transitions. [2025-03-16 20:50:20,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:50:20,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 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 294 [2025-03-16 20:50:20,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:20,273 INFO L225 Difference]: With dead ends: 2324 [2025-03-16 20:50:20,274 INFO L226 Difference]: Without dead ends: 1336 [2025-03-16 20:50:20,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:50:20,275 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 1015 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 2695 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:20,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 2695 Invalid, 1671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:50:20,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2025-03-16 20:50:20,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1332. [2025-03-16 20:50:20,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1320 states have (on average 1.4621212121212122) internal successors, (1930), 1320 states have internal predecessors, (1930), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 20:50:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1950 transitions. [2025-03-16 20:50:20,293 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1950 transitions. Word has length 294 [2025-03-16 20:50:20,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:20,293 INFO L471 AbstractCegarLoop]: Abstraction has 1332 states and 1950 transitions. [2025-03-16 20:50:20,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 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-16 20:50:20,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1950 transitions. [2025-03-16 20:50:20,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-16 20:50:20,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:20,295 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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] [2025-03-16 20:50:20,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 20:50:20,295 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:20,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:20,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1663771770, now seen corresponding path program 1 times [2025-03-16 20:50:20,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:20,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174749123] [2025-03-16 20:50:20,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:20,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:20,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-16 20:50:20,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-16 20:50:20,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:20,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-16 20:50:21,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:21,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174749123] [2025-03-16 20:50:21,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174749123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:21,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:21,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:50:21,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900188712] [2025-03-16 20:50:21,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:21,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:50:21,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:21,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:50:21,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:50:21,203 INFO L87 Difference]: Start difference. First operand 1332 states and 1950 transitions. Second operand has 9 states, 9 states have (on average 25.555555555555557) internal successors, (230), 9 states have internal predecessors, (230), 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-16 20:50:22,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:22,907 INFO L93 Difference]: Finished difference Result 4280 states and 6279 transitions. [2025-03-16 20:50:22,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:50:22,908 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 25.555555555555557) internal successors, (230), 9 states have internal predecessors, (230), 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 294 [2025-03-16 20:50:22,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:22,924 INFO L225 Difference]: With dead ends: 4280 [2025-03-16 20:50:22,927 INFO L226 Difference]: Without dead ends: 3362 [2025-03-16 20:50:22,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:50:22,930 INFO L435 NwaCegarLoop]: 1177 mSDtfsCounter, 2800 mSDsluCounter, 6033 mSDsCounter, 0 mSdLazyCounter, 4344 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2808 SdHoareTripleChecker+Valid, 7210 SdHoareTripleChecker+Invalid, 4347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:22,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2808 Valid, 7210 Invalid, 4347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4344 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 20:50:22,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2025-03-16 20:50:22,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 1700. [2025-03-16 20:50:22,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1678 states have (on average 1.4588796185935637) internal successors, (2448), 1678 states have internal predecessors, (2448), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 20:50:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2488 transitions. [2025-03-16 20:50:22,970 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2488 transitions. Word has length 294 [2025-03-16 20:50:22,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:22,970 INFO L471 AbstractCegarLoop]: Abstraction has 1700 states and 2488 transitions. [2025-03-16 20:50:22,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.555555555555557) internal successors, (230), 9 states have internal predecessors, (230), 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-16 20:50:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2488 transitions. [2025-03-16 20:50:22,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-16 20:50:22,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:22,973 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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] [2025-03-16 20:50:22,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 20:50:22,973 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:22,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:22,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1943924281, now seen corresponding path program 1 times [2025-03-16 20:50:22,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:22,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858415265] [2025-03-16 20:50:22,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:22,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:23,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-16 20:50:23,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-16 20:50:23,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:23,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:23,315 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-16 20:50:23,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:23,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858415265] [2025-03-16 20:50:23,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858415265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:23,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:23,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:23,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194934217] [2025-03-16 20:50:23,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:23,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:23,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:23,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:23,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:23,316 INFO L87 Difference]: Start difference. First operand 1700 states and 2488 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 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-16 20:50:23,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:23,538 INFO L93 Difference]: Finished difference Result 2830 states and 4144 transitions. [2025-03-16 20:50:23,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:23,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 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 295 [2025-03-16 20:50:23,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:23,542 INFO L225 Difference]: With dead ends: 2830 [2025-03-16 20:50:23,542 INFO L226 Difference]: Without dead ends: 1692 [2025-03-16 20:50:23,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:23,543 INFO L435 NwaCegarLoop]: 901 mSDtfsCounter, 1002 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:23,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 1808 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:23,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2025-03-16 20:50:23,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1692. [2025-03-16 20:50:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1670 states have (on average 1.4586826347305388) internal successors, (2436), 1670 states have internal predecessors, (2436), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 20:50:23,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 2476 transitions. [2025-03-16 20:50:23,566 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 2476 transitions. Word has length 295 [2025-03-16 20:50:23,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:23,567 INFO L471 AbstractCegarLoop]: Abstraction has 1692 states and 2476 transitions. [2025-03-16 20:50:23,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 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-16 20:50:23,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 2476 transitions. [2025-03-16 20:50:23,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-16 20:50:23,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:23,569 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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] [2025-03-16 20:50:23,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 20:50:23,569 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:23,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:23,569 INFO L85 PathProgramCache]: Analyzing trace with hash 459257582, now seen corresponding path program 1 times [2025-03-16 20:50:23,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:23,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344098404] [2025-03-16 20:50:23,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:23,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:23,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-16 20:50:23,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-16 20:50:23,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:23,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:24,096 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-16 20:50:24,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:24,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344098404] [2025-03-16 20:50:24,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344098404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:24,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:24,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:50:24,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511546281] [2025-03-16 20:50:24,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:24,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:50:24,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:24,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:50:24,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:50:24,098 INFO L87 Difference]: Start difference. First operand 1692 states and 2476 transitions. Second operand has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 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-16 20:50:24,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:24,910 INFO L93 Difference]: Finished difference Result 3321 states and 4875 transitions. [2025-03-16 20:50:24,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:50:24,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 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 295 [2025-03-16 20:50:24,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:24,916 INFO L225 Difference]: With dead ends: 3321 [2025-03-16 20:50:24,916 INFO L226 Difference]: Without dead ends: 2451 [2025-03-16 20:50:24,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:50:24,917 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 1735 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 2625 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:24,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1740 Valid, 2625 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1639 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 20:50:24,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2025-03-16 20:50:24,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 1404. [2025-03-16 20:50:24,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1387 states have (on average 1.4599855803893296) internal successors, (2025), 1387 states have internal predecessors, (2025), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 20:50:24,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2055 transitions. [2025-03-16 20:50:24,939 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2055 transitions. Word has length 295 [2025-03-16 20:50:24,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:24,939 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 2055 transitions. [2025-03-16 20:50:24,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 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-16 20:50:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2055 transitions. [2025-03-16 20:50:24,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-16 20:50:24,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:24,941 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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] [2025-03-16 20:50:24,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 20:50:24,941 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:24,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:24,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1108057287, now seen corresponding path program 1 times [2025-03-16 20:50:24,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:24,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930467203] [2025-03-16 20:50:24,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:24,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:24,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-16 20:50:25,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-16 20:50:25,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:25,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-16 20:50:25,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:25,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930467203] [2025-03-16 20:50:25,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930467203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:25,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:25,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:50:25,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337589307] [2025-03-16 20:50:25,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:25,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:50:25,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:25,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:50:25,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:50:25,485 INFO L87 Difference]: Start difference. First operand 1404 states and 2055 transitions. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 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-16 20:50:26,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:26,173 INFO L93 Difference]: Finished difference Result 2538 states and 3717 transitions. [2025-03-16 20:50:26,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:50:26,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 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 296 [2025-03-16 20:50:26,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:26,176 INFO L225 Difference]: With dead ends: 2538 [2025-03-16 20:50:26,176 INFO L226 Difference]: Without dead ends: 1410 [2025-03-16 20:50:26,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:50:26,178 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 1027 mSDsluCounter, 1992 mSDsCounter, 0 mSdLazyCounter, 1716 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 2660 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:26,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1031 Valid, 2660 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1716 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:50:26,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2025-03-16 20:50:26,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1407. [2025-03-16 20:50:26,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 1390 states have (on average 1.4589928057553956) internal successors, (2028), 1390 states have internal predecessors, (2028), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 20:50:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 2058 transitions. [2025-03-16 20:50:26,196 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 2058 transitions. Word has length 296 [2025-03-16 20:50:26,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:26,197 INFO L471 AbstractCegarLoop]: Abstraction has 1407 states and 2058 transitions. [2025-03-16 20:50:26,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 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-16 20:50:26,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 2058 transitions. [2025-03-16 20:50:26,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-16 20:50:26,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:26,198 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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] [2025-03-16 20:50:26,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 20:50:26,198 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:26,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:26,199 INFO L85 PathProgramCache]: Analyzing trace with hash 505821579, now seen corresponding path program 1 times [2025-03-16 20:50:26,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:26,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204537056] [2025-03-16 20:50:26,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:26,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:26,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-16 20:50:26,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-16 20:50:26,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:26,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-16 20:50:26,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:26,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204537056] [2025-03-16 20:50:26,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204537056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:26,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:26,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:50:26,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505393766] [2025-03-16 20:50:26,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:26,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:50:26,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:26,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:50:26,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:50:26,618 INFO L87 Difference]: Start difference. First operand 1407 states and 2058 transitions. Second operand has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 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-16 20:50:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:27,258 INFO L93 Difference]: Finished difference Result 2362 states and 3458 transitions. [2025-03-16 20:50:27,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:50:27,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 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 297 [2025-03-16 20:50:27,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:27,261 INFO L225 Difference]: With dead ends: 2362 [2025-03-16 20:50:27,261 INFO L226 Difference]: Without dead ends: 1413 [2025-03-16 20:50:27,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:50:27,263 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 985 mSDsluCounter, 1992 mSDsCounter, 0 mSdLazyCounter, 1716 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 2660 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:27,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 2660 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1716 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:50:27,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2025-03-16 20:50:27,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1410. [2025-03-16 20:50:27,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1393 states have (on average 1.4580043072505384) internal successors, (2031), 1393 states have internal predecessors, (2031), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 20:50:27,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2061 transitions. [2025-03-16 20:50:27,279 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2061 transitions. Word has length 297 [2025-03-16 20:50:27,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:27,280 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 2061 transitions. [2025-03-16 20:50:27,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 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-16 20:50:27,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2061 transitions. [2025-03-16 20:50:27,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-16 20:50:27,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:27,281 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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] [2025-03-16 20:50:27,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 20:50:27,281 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:27,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:27,282 INFO L85 PathProgramCache]: Analyzing trace with hash -812910659, now seen corresponding path program 1 times [2025-03-16 20:50:27,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:27,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285924543] [2025-03-16 20:50:27,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:27,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:27,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-16 20:50:27,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-16 20:50:27,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:27,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:27,892 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-16 20:50:27,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:27,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285924543] [2025-03-16 20:50:27,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285924543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:27,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:27,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:50:27,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142248427] [2025-03-16 20:50:27,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:27,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:50:27,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:27,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:50:27,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:50:27,894 INFO L87 Difference]: Start difference. First operand 1410 states and 2061 transitions. Second operand has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 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-16 20:50:28,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:28,346 INFO L93 Difference]: Finished difference Result 2634 states and 3866 transitions. [2025-03-16 20:50:28,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:50:28,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 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 298 [2025-03-16 20:50:28,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:28,349 INFO L225 Difference]: With dead ends: 2634 [2025-03-16 20:50:28,349 INFO L226 Difference]: Without dead ends: 1762 [2025-03-16 20:50:28,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:50:28,351 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 1777 mSDsluCounter, 3581 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1782 SdHoareTripleChecker+Valid, 4479 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:28,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1782 Valid, 4479 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:50:28,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2025-03-16 20:50:28,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1762. [2025-03-16 20:50:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1762 states, 1745 states have (on average 1.46189111747851) internal successors, (2551), 1745 states have internal predecessors, (2551), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 20:50:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2581 transitions. [2025-03-16 20:50:28,373 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2581 transitions. Word has length 298 [2025-03-16 20:50:28,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:28,373 INFO L471 AbstractCegarLoop]: Abstraction has 1762 states and 2581 transitions. [2025-03-16 20:50:28,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 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-16 20:50:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2581 transitions. [2025-03-16 20:50:28,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-03-16 20:50:28,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:28,377 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:28,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 20:50:28,378 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:28,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:28,378 INFO L85 PathProgramCache]: Analyzing trace with hash -325495430, now seen corresponding path program 1 times [2025-03-16 20:50:28,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:28,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390688921] [2025-03-16 20:50:28,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:28,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:28,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-16 20:50:28,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-16 20:50:28,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:28,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:29,017 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-16 20:50:29,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:29,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390688921] [2025-03-16 20:50:29,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390688921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:29,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:29,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:50:29,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321477051] [2025-03-16 20:50:29,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:29,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:50:29,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:29,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:50:29,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:50:29,019 INFO L87 Difference]: Start difference. First operand 1762 states and 2581 transitions. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:29,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:29,178 INFO L93 Difference]: Finished difference Result 2635 states and 3867 transitions. [2025-03-16 20:50:29,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:50:29,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 658 [2025-03-16 20:50:29,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:29,182 INFO L225 Difference]: With dead ends: 2635 [2025-03-16 20:50:29,182 INFO L226 Difference]: Without dead ends: 1763 [2025-03-16 20:50:29,183 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-16 20:50:29,183 INFO L435 NwaCegarLoop]: 914 mSDtfsCounter, 0 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:29,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1825 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:50:29,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2025-03-16 20:50:29,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1763. [2025-03-16 20:50:29,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1746 states have (on average 1.4616265750286368) internal successors, (2552), 1746 states have internal predecessors, (2552), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 20:50:29,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2582 transitions. [2025-03-16 20:50:29,203 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2582 transitions. Word has length 658 [2025-03-16 20:50:29,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:29,203 INFO L471 AbstractCegarLoop]: Abstraction has 1763 states and 2582 transitions. [2025-03-16 20:50:29,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:29,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2582 transitions. [2025-03-16 20:50:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2025-03-16 20:50:29,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:29,207 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:29,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 20:50:29,207 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:29,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:29,208 INFO L85 PathProgramCache]: Analyzing trace with hash -701435285, now seen corresponding path program 1 times [2025-03-16 20:50:29,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:29,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030568478] [2025-03-16 20:50:29,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:29,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:29,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 659 statements into 1 equivalence classes. [2025-03-16 20:50:29,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 659 of 659 statements. [2025-03-16 20:50:29,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:29,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:29,795 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 180 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-16 20:50:29,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:29,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030568478] [2025-03-16 20:50:29,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030568478] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:29,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220302881] [2025-03-16 20:50:29,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:29,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:29,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:29,798 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-16 20:50:29,801 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-16 20:50:30,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 659 statements into 1 equivalence classes. [2025-03-16 20:50:30,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 659 of 659 statements. [2025-03-16 20:50:30,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:30,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:30,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 3329 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 20:50:30,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:50:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-16 20:50:31,274 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:50:31,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220302881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:31,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:50:31,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-16 20:50:31,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715297623] [2025-03-16 20:50:31,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:31,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:31,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:31,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:31,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:50:31,276 INFO L87 Difference]: Start difference. First operand 1763 states and 2582 transitions. Second operand has 4 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:31,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:31,663 INFO L93 Difference]: Finished difference Result 2635 states and 3866 transitions. [2025-03-16 20:50:31,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:31,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 659 [2025-03-16 20:50:31,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:31,667 INFO L225 Difference]: With dead ends: 2635 [2025-03-16 20:50:31,667 INFO L226 Difference]: Without dead ends: 1762 [2025-03-16 20:50:31,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 658 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:50:31,668 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 820 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:31,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1345 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:50:31,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2025-03-16 20:50:31,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1762. [2025-03-16 20:50:31,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1762 states, 1745 states have (on average 1.4607449856733525) internal successors, (2549), 1745 states have internal predecessors, (2549), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 20:50:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2579 transitions. [2025-03-16 20:50:31,690 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2579 transitions. Word has length 659 [2025-03-16 20:50:31,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:31,690 INFO L471 AbstractCegarLoop]: Abstraction has 1762 states and 2579 transitions. [2025-03-16 20:50:31,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:31,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2579 transitions. [2025-03-16 20:50:31,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-03-16 20:50:31,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:31,694 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:31,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 20:50:31,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:31,895 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:31,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:31,896 INFO L85 PathProgramCache]: Analyzing trace with hash 2066778826, now seen corresponding path program 1 times [2025-03-16 20:50:31,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:31,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386015242] [2025-03-16 20:50:31,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:31,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:31,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-03-16 20:50:32,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-03-16 20:50:32,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:32,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 180 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-16 20:50:32,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:32,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386015242] [2025-03-16 20:50:32,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386015242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:32,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320418071] [2025-03-16 20:50:32,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:32,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:32,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:32,482 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-16 20:50:32,482 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-16 20:50:32,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-03-16 20:50:33,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-03-16 20:50:33,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:33,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:33,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 3332 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 20:50:33,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:50:33,775 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-16 20:50:33,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:50:33,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320418071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:33,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:50:33,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-16 20:50:33,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435967088] [2025-03-16 20:50:33,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:33,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:33,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:33,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:33,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:50:33,777 INFO L87 Difference]: Start difference. First operand 1762 states and 2579 transitions. Second operand has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:34,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:34,142 INFO L93 Difference]: Finished difference Result 2633 states and 3860 transitions. [2025-03-16 20:50:34,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:34,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 660 [2025-03-16 20:50:34,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:34,146 INFO L225 Difference]: With dead ends: 2633 [2025-03-16 20:50:34,146 INFO L226 Difference]: Without dead ends: 1761 [2025-03-16 20:50:34,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 659 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:50:34,148 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 812 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:34,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1345 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:50:34,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2025-03-16 20:50:34,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1761. [2025-03-16 20:50:34,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1744 states have (on average 1.459862385321101) internal successors, (2546), 1744 states have internal predecessors, (2546), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 20:50:34,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2576 transitions. [2025-03-16 20:50:34,169 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2576 transitions. Word has length 660 [2025-03-16 20:50:34,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:34,170 INFO L471 AbstractCegarLoop]: Abstraction has 1761 states and 2576 transitions. [2025-03-16 20:50:34,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2576 transitions. [2025-03-16 20:50:34,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-03-16 20:50:34,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:34,174 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:34,187 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-16 20:50:34,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:34,374 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:34,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:34,375 INFO L85 PathProgramCache]: Analyzing trace with hash -644555755, now seen corresponding path program 1 times [2025-03-16 20:50:34,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:34,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580839554] [2025-03-16 20:50:34,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:34,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:34,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-03-16 20:50:34,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-03-16 20:50:34,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:34,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 180 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-16 20:50:35,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:35,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580839554] [2025-03-16 20:50:35,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580839554] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:35,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711548835] [2025-03-16 20:50:35,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:35,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:35,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:35,048 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-16 20:50:35,050 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-16 20:50:35,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-03-16 20:50:35,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-03-16 20:50:35,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:35,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:35,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 3335 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 20:50:35,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:50:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-16 20:50:36,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:50:36,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711548835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:36,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:50:36,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-16 20:50:36,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521415491] [2025-03-16 20:50:36,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:36,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:36,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:36,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:36,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:50:36,483 INFO L87 Difference]: Start difference. First operand 1761 states and 2576 transitions. Second operand has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:36,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:36,868 INFO L93 Difference]: Finished difference Result 2631 states and 3854 transitions. [2025-03-16 20:50:36,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:36,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 661 [2025-03-16 20:50:36,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:36,872 INFO L225 Difference]: With dead ends: 2631 [2025-03-16 20:50:36,872 INFO L226 Difference]: Without dead ends: 1760 [2025-03-16 20:50:36,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 660 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:50:36,873 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 798 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:36,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1345 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:50:36,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2025-03-16 20:50:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1760. [2025-03-16 20:50:36,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1743 states have (on average 1.4589787722317842) internal successors, (2543), 1743 states have internal predecessors, (2543), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 20:50:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2573 transitions. [2025-03-16 20:50:36,894 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2573 transitions. Word has length 661 [2025-03-16 20:50:36,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:36,894 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2573 transitions. [2025-03-16 20:50:36,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:36,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2573 transitions. [2025-03-16 20:50:36,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-03-16 20:50:36,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:36,898 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:36,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 20:50:37,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:37,099 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:37,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:37,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1752524863, now seen corresponding path program 1 times [2025-03-16 20:50:37,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:37,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517942446] [2025-03-16 20:50:37,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:37,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:37,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-03-16 20:50:37,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-03-16 20:50:37,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:37,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:37,721 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 180 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-16 20:50:37,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:37,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517942446] [2025-03-16 20:50:37,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517942446] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:37,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061074337] [2025-03-16 20:50:37,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:37,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:37,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:37,723 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-16 20:50:37,725 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-16 20:50:38,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-03-16 20:50:38,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-03-16 20:50:38,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:38,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:38,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 3338 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 20:50:38,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:50:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 280 proven. 92 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-03-16 20:50:39,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:50:39,592 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-16 20:50:39,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061074337] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:39,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 20:50:39,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 14] total 19 [2025-03-16 20:50:39,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917152207] [2025-03-16 20:50:39,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:39,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:50:39,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:39,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:50:39,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-16 20:50:39,594 INFO L87 Difference]: Start difference. First operand 1760 states and 2573 transitions. Second operand has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:39,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:39,882 INFO L93 Difference]: Finished difference Result 2630 states and 3849 transitions. [2025-03-16 20:50:39,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:39,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 662 [2025-03-16 20:50:39,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:39,885 INFO L225 Difference]: With dead ends: 2630 [2025-03-16 20:50:39,885 INFO L226 Difference]: Without dead ends: 1760 [2025-03-16 20:50:39,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1327 GetRequests, 1309 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-16 20:50:39,886 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 1789 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1794 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:39,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1794 Valid, 1663 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:50:39,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2025-03-16 20:50:39,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1760. [2025-03-16 20:50:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1743 states have (on average 1.4584050487664946) internal successors, (2542), 1743 states have internal predecessors, (2542), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 20:50:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2572 transitions. [2025-03-16 20:50:39,915 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2572 transitions. Word has length 662 [2025-03-16 20:50:39,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:39,916 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2572 transitions. [2025-03-16 20:50:39,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:39,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2572 transitions. [2025-03-16 20:50:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-03-16 20:50:39,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:39,920 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:39,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-16 20:50:40,120 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,SelfDestructingSolverStorable31 [2025-03-16 20:50:40,121 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:40,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:40,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1876863050, now seen corresponding path program 1 times [2025-03-16 20:50:40,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:40,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068996611] [2025-03-16 20:50:40,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:40,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:40,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-03-16 20:50:40,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-03-16 20:50:40,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:40,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:40,691 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 180 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-16 20:50:40,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:40,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068996611] [2025-03-16 20:50:40,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068996611] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:40,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042940496] [2025-03-16 20:50:40,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:40,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:40,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:40,694 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-16 20:50:40,695 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-16 20:50:41,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-03-16 20:50:41,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-03-16 20:50:41,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:41,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:41,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 3341 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 20:50:41,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:50:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 280 proven. 92 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-03-16 20:50:42,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:50:42,761 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-16 20:50:42,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042940496] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:42,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 20:50:42,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 14] total 19 [2025-03-16 20:50:42,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512609160] [2025-03-16 20:50:42,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:42,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:50:42,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:42,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:50:42,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-16 20:50:42,762 INFO L87 Difference]: Start difference. First operand 1760 states and 2572 transitions. Second operand has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:43,032 INFO L93 Difference]: Finished difference Result 2630 states and 3847 transitions. [2025-03-16 20:50:43,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:43,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 663 [2025-03-16 20:50:43,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:43,039 INFO L225 Difference]: With dead ends: 2630 [2025-03-16 20:50:43,039 INFO L226 Difference]: Without dead ends: 1760 [2025-03-16 20:50:43,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1329 GetRequests, 1311 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-16 20:50:43,041 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 884 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:43,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 1671 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:43,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2025-03-16 20:50:43,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1760. [2025-03-16 20:50:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1743 states have (on average 1.4578313253012047) internal successors, (2541), 1743 states have internal predecessors, (2541), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 20:50:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2571 transitions. [2025-03-16 20:50:43,060 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2571 transitions. Word has length 663 [2025-03-16 20:50:43,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:43,060 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2571 transitions. [2025-03-16 20:50:43,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:43,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2571 transitions. [2025-03-16 20:50:43,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2025-03-16 20:50:43,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:43,064 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:43,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-16 20:50:43,264 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,SelfDestructingSolverStorable32 [2025-03-16 20:50:43,264 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:43,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:43,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1196896058, now seen corresponding path program 1 times [2025-03-16 20:50:43,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:43,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674233777] [2025-03-16 20:50:43,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:43,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:43,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes. [2025-03-16 20:50:43,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements. [2025-03-16 20:50:43,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:43,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 180 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-16 20:50:43,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:43,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674233777] [2025-03-16 20:50:43,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674233777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:43,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007647840] [2025-03-16 20:50:43,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:43,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:43,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:43,838 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-16 20:50:43,839 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-16 20:50:44,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes. [2025-03-16 20:50:44,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements. [2025-03-16 20:50:44,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:44,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:44,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 3344 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 20:50:44,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:50:45,335 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 280 proven. 92 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-03-16 20:50:45,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:50:45,935 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-16 20:50:45,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007647840] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:45,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 20:50:45,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 14] total 19 [2025-03-16 20:50:45,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481524597] [2025-03-16 20:50:45,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:45,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:50:45,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:45,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:50:45,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-16 20:50:45,937 INFO L87 Difference]: Start difference. First operand 1760 states and 2571 transitions. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:46,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:46,245 INFO L93 Difference]: Finished difference Result 2630 states and 3845 transitions. [2025-03-16 20:50:46,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:46,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 664 [2025-03-16 20:50:46,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:46,248 INFO L225 Difference]: With dead ends: 2630 [2025-03-16 20:50:46,248 INFO L226 Difference]: Without dead ends: 1760 [2025-03-16 20:50:46,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1331 GetRequests, 1313 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-16 20:50:46,250 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 1753 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1758 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:46,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1758 Valid, 1663 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:50:46,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2025-03-16 20:50:46,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1760. [2025-03-16 20:50:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1743 states have (on average 1.4572576018359151) internal successors, (2540), 1743 states have internal predecessors, (2540), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 20:50:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2570 transitions. [2025-03-16 20:50:46,282 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2570 transitions. Word has length 664 [2025-03-16 20:50:46,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:46,283 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2570 transitions. [2025-03-16 20:50:46,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:46,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2570 transitions. [2025-03-16 20:50:46,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2025-03-16 20:50:46,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:46,289 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:46,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-16 20:50:46,492 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,SelfDestructingSolverStorable33 [2025-03-16 20:50:46,493 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:46,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:46,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1814850156, now seen corresponding path program 1 times [2025-03-16 20:50:46,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:46,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788049519] [2025-03-16 20:50:46,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:46,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:46,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-03-16 20:50:46,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-03-16 20:50:46,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:46,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:47,141 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 180 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-16 20:50:47,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:47,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788049519] [2025-03-16 20:50:47,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788049519] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:47,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441020373] [2025-03-16 20:50:47,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:47,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:47,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:47,144 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-16 20:50:47,144 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-16 20:50:47,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-03-16 20:50:48,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-03-16 20:50:48,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:48,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:48,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 3347 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 20:50:48,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:50:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 280 proven. 92 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-03-16 20:50:48,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:50:49,278 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-16 20:50:49,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441020373] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:49,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 20:50:49,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 14] total 19 [2025-03-16 20:50:49,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83928153] [2025-03-16 20:50:49,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:49,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:50:49,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:49,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:50:49,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-16 20:50:49,280 INFO L87 Difference]: Start difference. First operand 1760 states and 2570 transitions. Second operand has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:49,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:49,549 INFO L93 Difference]: Finished difference Result 2630 states and 3843 transitions. [2025-03-16 20:50:49,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:49,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 665 [2025-03-16 20:50:49,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:49,551 INFO L225 Difference]: With dead ends: 2630 [2025-03-16 20:50:49,551 INFO L226 Difference]: Without dead ends: 1760 [2025-03-16 20:50:49,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1333 GetRequests, 1315 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-16 20:50:49,553 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 866 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:49,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1671 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:49,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2025-03-16 20:50:49,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1760. [2025-03-16 20:50:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1743 states have (on average 1.4566838783706253) internal successors, (2539), 1743 states have internal predecessors, (2539), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 20:50:49,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2569 transitions. [2025-03-16 20:50:49,574 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2569 transitions. Word has length 665 [2025-03-16 20:50:49,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:49,574 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2569 transitions. [2025-03-16 20:50:49,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:49,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2569 transitions. [2025-03-16 20:50:49,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2025-03-16 20:50:49,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:49,578 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:49,594 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-16 20:50:49,782 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,SelfDestructingSolverStorable34 [2025-03-16 20:50:49,782 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:49,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:49,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1692688237, now seen corresponding path program 1 times [2025-03-16 20:50:49,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:49,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127091991] [2025-03-16 20:50:49,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:49,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:49,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-03-16 20:50:49,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-03-16 20:50:49,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:49,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:50,364 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 180 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-16 20:50:50,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:50,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127091991] [2025-03-16 20:50:50,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127091991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:50,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452712987] [2025-03-16 20:50:50,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:50,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:50,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:50,366 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-16 20:50:50,367 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-16 20:50:51,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-03-16 20:50:51,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-03-16 20:50:51,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:51,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:51,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 3350 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 20:50:51,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:50:51,388 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 280 proven. 8 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2025-03-16 20:50:51,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:50:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-16 20:50:51,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452712987] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:51,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 20:50:51,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2025-03-16 20:50:51,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247913033] [2025-03-16 20:50:51,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:51,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:50:51,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:51,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:50:51,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:50:51,429 INFO L87 Difference]: Start difference. First operand 1760 states and 2569 transitions. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:51,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:51,604 INFO L93 Difference]: Finished difference Result 2631 states and 3843 transitions. [2025-03-16 20:50:51,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:50:51,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 666 [2025-03-16 20:50:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:51,607 INFO L225 Difference]: With dead ends: 2631 [2025-03-16 20:50:51,607 INFO L226 Difference]: Without dead ends: 1761 [2025-03-16 20:50:51,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1334 GetRequests, 1329 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:50:51,608 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 0 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:51,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1805 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:51,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2025-03-16 20:50:51,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1761. [2025-03-16 20:50:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1744 states have (on average 1.4564220183486238) internal successors, (2540), 1744 states have internal predecessors, (2540), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 20:50:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2570 transitions. [2025-03-16 20:50:51,628 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2570 transitions. Word has length 666 [2025-03-16 20:50:51,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:51,628 INFO L471 AbstractCegarLoop]: Abstraction has 1761 states and 2570 transitions. [2025-03-16 20:50:51,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:51,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2570 transitions. [2025-03-16 20:50:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-03-16 20:50:51,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:51,632 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:51,647 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-16 20:50:51,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:51,832 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:51,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:51,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1178773998, now seen corresponding path program 1 times [2025-03-16 20:50:51,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:51,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781969683] [2025-03-16 20:50:51,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:51,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:51,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-03-16 20:50:52,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-03-16 20:50:52,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:52,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:52,435 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 180 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-16 20:50:52,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:52,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781969683] [2025-03-16 20:50:52,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781969683] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:52,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112948904] [2025-03-16 20:50:52,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:52,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:52,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:52,439 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-16 20:50:52,440 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-16 20:50:53,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-03-16 20:50:53,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-03-16 20:50:53,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:53,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:53,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 3359 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 20:50:53,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:50:53,505 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 280 proven. 8 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2025-03-16 20:50:53,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:50:53,537 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2025-03-16 20:50:53,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112948904] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:53,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 20:50:53,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2025-03-16 20:50:53,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491325303] [2025-03-16 20:50:53,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:53,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:50:53,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:53,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:50:53,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:50:53,539 INFO L87 Difference]: Start difference. First operand 1761 states and 2570 transitions. Second operand has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:53,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:53,698 INFO L93 Difference]: Finished difference Result 2633 states and 3845 transitions. [2025-03-16 20:50:53,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:50:53,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 667 [2025-03-16 20:50:53,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:53,700 INFO L225 Difference]: With dead ends: 2633 [2025-03-16 20:50:53,701 INFO L226 Difference]: Without dead ends: 1762 [2025-03-16 20:50:53,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1336 GetRequests, 1331 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:50:53,702 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 0 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:53,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1805 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:50:53,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2025-03-16 20:50:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1762. [2025-03-16 20:50:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1762 states, 1745 states have (on average 1.4561604584527221) internal successors, (2541), 1745 states have internal predecessors, (2541), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 20:50:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2571 transitions. [2025-03-16 20:50:53,721 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2571 transitions. Word has length 667 [2025-03-16 20:50:53,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:53,722 INFO L471 AbstractCegarLoop]: Abstraction has 1762 states and 2571 transitions. [2025-03-16 20:50:53,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2571 transitions. [2025-03-16 20:50:53,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2025-03-16 20:50:53,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:53,725 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:53,742 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-16 20:50:53,926 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,SelfDestructingSolverStorable36 [2025-03-16 20:50:53,926 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:53,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:53,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1932382221, now seen corresponding path program 1 times [2025-03-16 20:50:53,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:53,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598767649] [2025-03-16 20:50:53,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:53,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:53,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 668 statements into 1 equivalence classes. [2025-03-16 20:50:54,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 668 of 668 statements. [2025-03-16 20:50:54,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:54,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:54,579 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 180 proven. 1 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2025-03-16 20:50:54,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:54,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598767649] [2025-03-16 20:50:54,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598767649] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:54,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888755045] [2025-03-16 20:50:54,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:54,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:54,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:54,581 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-16 20:50:54,582 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-16 20:50:55,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 668 statements into 1 equivalence classes. [2025-03-16 20:50:55,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 668 of 668 statements. [2025-03-16 20:50:55,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:55,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:55,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 3368 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 20:50:55,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:50:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 280 proven. 8 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2025-03-16 20:50:55,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:50:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2025-03-16 20:50:55,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888755045] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:55,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 20:50:55,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2025-03-16 20:50:55,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276680694] [2025-03-16 20:50:55,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:55,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:50:55,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:55,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:50:55,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:50:55,778 INFO L87 Difference]: Start difference. First operand 1762 states and 2571 transitions. Second operand has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:55,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:55,935 INFO L93 Difference]: Finished difference Result 2635 states and 3847 transitions. [2025-03-16 20:50:55,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:50:55,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 668 [2025-03-16 20:50:55,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:55,937 INFO L225 Difference]: With dead ends: 2635 [2025-03-16 20:50:55,937 INFO L226 Difference]: Without dead ends: 1763 [2025-03-16 20:50:55,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1338 GetRequests, 1333 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:50:55,938 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 0 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:55,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1805 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:50:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2025-03-16 20:50:55,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1763. [2025-03-16 20:50:55,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1746 states have (on average 1.4558991981672393) internal successors, (2542), 1746 states have internal predecessors, (2542), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 20:50:55,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2572 transitions. [2025-03-16 20:50:55,955 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2572 transitions. Word has length 668 [2025-03-16 20:50:55,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:55,955 INFO L471 AbstractCegarLoop]: Abstraction has 1763 states and 2572 transitions. [2025-03-16 20:50:55,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 20:50:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2572 transitions. [2025-03-16 20:50:55,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2025-03-16 20:50:55,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:55,959 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:55,975 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-16 20:50:56,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-16 20:50:56,159 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:56,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:56,160 INFO L85 PathProgramCache]: Analyzing trace with hash 381706642, now seen corresponding path program 1 times [2025-03-16 20:50:56,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:56,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262656221] [2025-03-16 20:50:56,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:56,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:56,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-03-16 20:50:56,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-03-16 20:50:56,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:56,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:56,718 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 180 proven. 1 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2025-03-16 20:50:56,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:56,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262656221] [2025-03-16 20:50:56,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262656221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:56,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285246035] [2025-03-16 20:50:56,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:56,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:56,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:56,720 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-16 20:50:56,721 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-16 20:50:57,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-03-16 20:50:57,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-03-16 20:50:57,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:57,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:57,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 3377 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 20:50:57,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:50:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 280 proven. 30 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-03-16 20:50:57,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:50:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 180 proven. 1 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2025-03-16 20:50:57,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285246035] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:50:57,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:50:57,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2025-03-16 20:50:57,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388428110] [2025-03-16 20:50:57,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:50:57,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:50:57,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:57,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:50:57,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:50:57,940 INFO L87 Difference]: Start difference. First operand 1763 states and 2572 transitions. Second operand has 9 states, 9 states have (on average 65.88888888888889) internal successors, (593), 9 states have internal predecessors, (593), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 20:50:58,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:58,337 INFO L93 Difference]: Finished difference Result 2639 states and 3853 transitions. [2025-03-16 20:50:58,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:50:58,337 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 65.88888888888889) internal successors, (593), 9 states have internal predecessors, (593), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 669 [2025-03-16 20:50:58,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:58,339 INFO L225 Difference]: With dead ends: 2639 [2025-03-16 20:50:58,339 INFO L226 Difference]: Without dead ends: 1766 [2025-03-16 20:50:58,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1341 GetRequests, 1333 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:50:58,340 INFO L435 NwaCegarLoop]: 906 mSDtfsCounter, 10 mSDsluCounter, 4509 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5415 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:58,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5415 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:50:58,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2025-03-16 20:50:58,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1766. [2025-03-16 20:50:58,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1749 states have (on average 1.455117209834191) internal successors, (2545), 1749 states have internal predecessors, (2545), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 20:50:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2575 transitions. [2025-03-16 20:50:58,359 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2575 transitions. Word has length 669 [2025-03-16 20:50:58,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:58,359 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2575 transitions. [2025-03-16 20:50:58,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 65.88888888888889) internal successors, (593), 9 states have internal predecessors, (593), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 20:50:58,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2575 transitions. [2025-03-16 20:50:58,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2025-03-16 20:50:58,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:58,363 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:58,379 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-16 20:50:58,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-16 20:50:58,564 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:58,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:58,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1532796383, now seen corresponding path program 2 times [2025-03-16 20:50:58,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:58,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688865736] [2025-03-16 20:50:58,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 20:50:58,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:58,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 672 statements into 2 equivalence classes. [2025-03-16 20:50:58,665 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 177 of 672 statements. [2025-03-16 20:50:58,665 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 20:50:58,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2025-03-16 20:50:58,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:58,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688865736] [2025-03-16 20:50:58,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688865736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:58,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:58,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:50:58,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199519295] [2025-03-16 20:50:58,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:58,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:50:58,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:58,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:50:58,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:50:58,866 INFO L87 Difference]: Start difference. First operand 1766 states and 2575 transitions. Second operand has 7 states, 7 states have (on average 70.85714285714286) internal successors, (496), 7 states have internal predecessors, (496), 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-16 20:50:59,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:59,235 INFO L93 Difference]: Finished difference Result 2650 states and 3864 transitions. [2025-03-16 20:50:59,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:50:59,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 70.85714285714286) internal successors, (496), 7 states have internal predecessors, (496), 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 672 [2025-03-16 20:50:59,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:59,238 INFO L225 Difference]: With dead ends: 2650 [2025-03-16 20:50:59,238 INFO L226 Difference]: Without dead ends: 1774 [2025-03-16 20:50:59,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:50:59,239 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 149 mSDsluCounter, 4480 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 5379 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:59,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 5379 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:50:59,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2025-03-16 20:50:59,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1767. [2025-03-16 20:50:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1750 states have (on average 1.4554285714285715) internal successors, (2547), 1750 states have internal predecessors, (2547), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 20:50:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2577 transitions. [2025-03-16 20:50:59,259 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2577 transitions. Word has length 672 [2025-03-16 20:50:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:59,260 INFO L471 AbstractCegarLoop]: Abstraction has 1767 states and 2577 transitions. [2025-03-16 20:50:59,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 70.85714285714286) internal successors, (496), 7 states have internal predecessors, (496), 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-16 20:50:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2577 transitions. [2025-03-16 20:50:59,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-03-16 20:50:59,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:59,263 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:59,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 20:50:59,264 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:59,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:59,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1451887167, now seen corresponding path program 1 times [2025-03-16 20:50:59,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:59,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693124823] [2025-03-16 20:50:59,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:59,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:59,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-03-16 20:50:59,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-03-16 20:50:59,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:59,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2025-03-16 20:50:59,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:59,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693124823] [2025-03-16 20:50:59,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693124823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:59,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617140784] [2025-03-16 20:50:59,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:59,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:59,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:59,976 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-16 20:50:59,977 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-16 20:51:00,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-03-16 20:51:01,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-03-16 20:51:01,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:01,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:01,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 3405 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-16 20:51:01,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 280 proven. 84 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2025-03-16 20:51:01,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:51:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2025-03-16 20:51:01,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617140784] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:51:01,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:51:01,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 7] total 18 [2025-03-16 20:51:01,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077636727] [2025-03-16 20:51:01,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:51:01,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 20:51:01,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:01,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 20:51:01,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-03-16 20:51:01,279 INFO L87 Difference]: Start difference. First operand 1767 states and 2577 transitions. Second operand has 18 states, 18 states have (on average 33.833333333333336) internal successors, (609), 18 states have internal predecessors, (609), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 20:51:02,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:02,039 INFO L93 Difference]: Finished difference Result 2650 states and 3867 transitions. [2025-03-16 20:51:02,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 20:51:02,040 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 33.833333333333336) internal successors, (609), 18 states have internal predecessors, (609), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 673 [2025-03-16 20:51:02,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:02,042 INFO L225 Difference]: With dead ends: 2650 [2025-03-16 20:51:02,042 INFO L226 Difference]: Without dead ends: 1771 [2025-03-16 20:51:02,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1353 GetRequests, 1335 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-16 20:51:02,043 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 22 mSDsluCounter, 11880 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 12798 SdHoareTripleChecker+Invalid, 2714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:02,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 12798 Invalid, 2714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 20:51:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2025-03-16 20:51:02,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1771. [2025-03-16 20:51:02,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1754 states have (on average 1.4543899657924744) internal successors, (2551), 1754 states have internal predecessors, (2551), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 20:51:02,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2581 transitions. [2025-03-16 20:51:02,062 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2581 transitions. Word has length 673 [2025-03-16 20:51:02,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:02,063 INFO L471 AbstractCegarLoop]: Abstraction has 1771 states and 2581 transitions. [2025-03-16 20:51:02,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 33.833333333333336) internal successors, (609), 18 states have internal predecessors, (609), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 20:51:02,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2581 transitions. [2025-03-16 20:51:02,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2025-03-16 20:51:02,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:02,066 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:51:02,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-16 20:51:02,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:02,267 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:02,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:02,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1485224321, now seen corresponding path program 2 times [2025-03-16 20:51:02,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:02,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971728826] [2025-03-16 20:51:02,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 20:51:02,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:02,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 677 statements into 2 equivalence classes. [2025-03-16 20:51:02,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 178 of 677 statements. [2025-03-16 20:51:02,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 20:51:02,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 4 proven. 112 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2025-03-16 20:51:03,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:03,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971728826] [2025-03-16 20:51:03,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971728826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:03,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556526710] [2025-03-16 20:51:03,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 20:51:03,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:03,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:03,130 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-16 20:51:03,131 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-16 20:51:04,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 677 statements into 2 equivalence classes. [2025-03-16 20:51:04,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 178 of 677 statements. [2025-03-16 20:51:04,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 20:51:04,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:04,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-16 20:51:04,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 274 proven. 3 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2025-03-16 20:51:05,071 INFO L312 TraceCheckSpWp]: Computing backward predicates...