./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7ea381ec8ed14f66c767c1e3d74aca72e3c49fc21baf435ac33ef40352270e74 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:44:36,231 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:44:36,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:44:36,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:44:36,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:44:36,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:44:36,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:44:36,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:44:36,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:44:36,334 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:44:36,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:44:36,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:44:36,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:44:36,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:44:36,336 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:44:36,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:44:36,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:44:36,337 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:44:36,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:44:36,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:44:36,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:44:36,337 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:44:36,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:44:36,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:44:36,338 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:44:36,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:44:36,338 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:44:36,338 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:44:36,338 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:44:36,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:44:36,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:44:36,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:44:36,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:44:36,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:44:36,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:44:36,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:44:36,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:44:36,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:44:36,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:44:36,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:44:36,339 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:44:36,339 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:44:36,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:44:36,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:44:36,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:44:36,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:44:36,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:44:36,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:44:36,340 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7ea381ec8ed14f66c767c1e3d74aca72e3c49fc21baf435ac33ef40352270e74 [2025-01-09 05:44:36,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:44:36,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:44:36,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:44:36,637 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:44:36,638 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:44:36,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-01-09 05:44:37,925 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df8acf4b6/5f0577892959429d8ba5930847563f1d/FLAGf74b2235b [2025-01-09 05:44:38,591 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:44:38,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-01-09 05:44:38,621 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df8acf4b6/5f0577892959429d8ba5930847563f1d/FLAGf74b2235b [2025-01-09 05:44:39,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df8acf4b6/5f0577892959429d8ba5930847563f1d [2025-01-09 05:44:39,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:44:39,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:44:39,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:44:39,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:44:39,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:44:39,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:44:39" (1/1) ... [2025-01-09 05:44:39,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207b3483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:39, skipping insertion in model container [2025-01-09 05:44:39,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:44:39" (1/1) ... [2025-01-09 05:44:39,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:44:39,434 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[6524,6537] [2025-01-09 05:44:39,498 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[14272,14285] [2025-01-09 05:44:40,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:44:40,025 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:44:40,045 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[6524,6537] [2025-01-09 05:44:40,055 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[14272,14285] [2025-01-09 05:44:40,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:44:40,431 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:44:40,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:40 WrapperNode [2025-01-09 05:44:40,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:44:40,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:44:40,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:44:40,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:44:40,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:40" (1/1) ... [2025-01-09 05:44:40,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:40" (1/1) ... [2025-01-09 05:44:40,825 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4975 [2025-01-09 05:44:40,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:44:40,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:44:40,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:44:40,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:44:40,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:40" (1/1) ... [2025-01-09 05:44:40,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:40" (1/1) ... [2025-01-09 05:44:40,896 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:40" (1/1) ... [2025-01-09 05:44:41,089 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 05:44:41,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:40" (1/1) ... [2025-01-09 05:44:41,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:40" (1/1) ... [2025-01-09 05:44:41,248 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:40" (1/1) ... [2025-01-09 05:44:41,265 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:40" (1/1) ... [2025-01-09 05:44:41,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:40" (1/1) ... [2025-01-09 05:44:41,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:40" (1/1) ... [2025-01-09 05:44:41,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:40" (1/1) ... [2025-01-09 05:44:41,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:44:41,423 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:44:41,423 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:44:41,423 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:44:41,424 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:40" (1/1) ... [2025-01-09 05:44:41,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:44:41,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:44:41,458 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:44:41,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:44:41,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:44:41,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:44:41,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:44:41,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:44:41,589 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:44:41,591 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:44:46,196 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2025-01-09 05:44:46,197 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:44:46,231 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:44:46,232 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 05:44:46,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:44:46 BoogieIcfgContainer [2025-01-09 05:44:46,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:44:46,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:44:46,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:44:46,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:44:46,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:44:39" (1/3) ... [2025-01-09 05:44:46,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6492cfb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:44:46, skipping insertion in model container [2025-01-09 05:44:46,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:40" (2/3) ... [2025-01-09 05:44:46,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6492cfb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:44:46, skipping insertion in model container [2025-01-09 05:44:46,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:44:46" (3/3) ... [2025-01-09 05:44:46,249 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-01-09 05:44:46,265 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:44:46,268 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c that has 1 procedures, 871 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:44:46,353 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:44:46,364 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;@64053648, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:44:46,365 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:44:46,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 871 states, 868 states have (on average 1.9055299539170507) internal successors, (1654), 870 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:46,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 05:44:46,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:46,380 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:44:46,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:46,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:46,387 INFO L85 PathProgramCache]: Analyzing trace with hash -772458771, now seen corresponding path program 1 times [2025-01-09 05:44:46,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:46,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674478560] [2025-01-09 05:44:46,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:46,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:46,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 05:44:46,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 05:44:46,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:46,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:46,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:46,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:46,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674478560] [2025-01-09 05:44:46,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674478560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:46,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:46,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:44:46,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979899] [2025-01-09 05:44:46,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:46,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 05:44:46,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:46,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 05:44:46,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:44:46,642 INFO L87 Difference]: Start difference. First operand has 871 states, 868 states have (on average 1.9055299539170507) internal successors, (1654), 870 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:46,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:46,714 INFO L93 Difference]: Finished difference Result 1719 states and 3267 transitions. [2025-01-09 05:44:46,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 05:44:46,716 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-09 05:44:46,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:46,738 INFO L225 Difference]: With dead ends: 1719 [2025-01-09 05:44:46,738 INFO L226 Difference]: Without dead ends: 806 [2025-01-09 05:44:46,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-01-09 05:44:46,746 INFO L435 NwaCegarLoop]: 1588 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:46,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:46,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-01-09 05:44:46,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2025-01-09 05:44:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 804 states have (on average 1.8955223880597014) internal successors, (1524), 805 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:46,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1524 transitions. [2025-01-09 05:44:46,836 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1524 transitions. Word has length 20 [2025-01-09 05:44:46,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:46,837 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1524 transitions. [2025-01-09 05:44:46,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:46,837 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1524 transitions. [2025-01-09 05:44:46,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 05:44:46,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:46,839 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:44:46,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:44:46,840 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:46,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:46,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1783576021, now seen corresponding path program 1 times [2025-01-09 05:44:46,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:46,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769552193] [2025-01-09 05:44:46,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:46,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:46,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 05:44:46,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 05:44:46,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:46,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:47,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:47,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769552193] [2025-01-09 05:44:47,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769552193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:47,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:47,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:44:47,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112499429] [2025-01-09 05:44:47,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:47,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:44:47,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:47,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:44:47,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:44:47,053 INFO L87 Difference]: Start difference. First operand 806 states and 1524 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:47,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:47,148 INFO L93 Difference]: Finished difference Result 840 states and 1575 transitions. [2025-01-09 05:44:47,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:44:47,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-09 05:44:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:47,156 INFO L225 Difference]: With dead ends: 840 [2025-01-09 05:44:47,156 INFO L226 Difference]: Without dead ends: 806 [2025-01-09 05:44:47,157 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-01-09 05:44:47,158 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 0 mSDsluCounter, 4545 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6067 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:47,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6067 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:47,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-01-09 05:44:47,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2025-01-09 05:44:47,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 804 states have (on average 1.8756218905472637) internal successors, (1508), 805 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1508 transitions. [2025-01-09 05:44:47,183 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1508 transitions. Word has length 20 [2025-01-09 05:44:47,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:47,183 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1508 transitions. [2025-01-09 05:44:47,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1508 transitions. [2025-01-09 05:44:47,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 05:44:47,185 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:47,186 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:44:47,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:44:47,186 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:47,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:47,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1388544739, now seen corresponding path program 1 times [2025-01-09 05:44:47,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:47,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501363684] [2025-01-09 05:44:47,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:47,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:47,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 05:44:47,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 05:44:47,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:47,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:47,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:47,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:47,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501363684] [2025-01-09 05:44:47,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501363684] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:47,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:47,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:44:47,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889401158] [2025-01-09 05:44:47,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:47,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:44:47,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:47,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:44:47,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:44:47,372 INFO L87 Difference]: Start difference. First operand 806 states and 1508 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:47,503 INFO L93 Difference]: Finished difference Result 986 states and 1790 transitions. [2025-01-09 05:44:47,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:44:47,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-01-09 05:44:47,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:47,508 INFO L225 Difference]: With dead ends: 986 [2025-01-09 05:44:47,508 INFO L226 Difference]: Without dead ends: 956 [2025-01-09 05:44:47,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:44:47,512 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 4589 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4589 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:47,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4589 Valid, 1865 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:44:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-01-09 05:44:47,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 834. [2025-01-09 05:44:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 832 states have (on average 1.8653846153846154) internal successors, (1552), 833 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1552 transitions. [2025-01-09 05:44:47,538 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1552 transitions. Word has length 35 [2025-01-09 05:44:47,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:47,538 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1552 transitions. [2025-01-09 05:44:47,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:47,538 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1552 transitions. [2025-01-09 05:44:47,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 05:44:47,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:47,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:44:47,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:44:47,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:47,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:47,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1535930931, now seen corresponding path program 1 times [2025-01-09 05:44:47,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:47,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481116089] [2025-01-09 05:44:47,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:47,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:47,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 05:44:47,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 05:44:47,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:47,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:47,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:47,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:47,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481116089] [2025-01-09 05:44:47,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481116089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:47,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:47,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:44:47,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441503496] [2025-01-09 05:44:47,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:47,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:44:47,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:47,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:44:47,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:44:47,663 INFO L87 Difference]: Start difference. First operand 834 states and 1552 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:47,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:47,697 INFO L93 Difference]: Finished difference Result 939 states and 1715 transitions. [2025-01-09 05:44:47,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:44:47,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 05:44:47,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:47,703 INFO L225 Difference]: With dead ends: 939 [2025-01-09 05:44:47,705 INFO L226 Difference]: Without dead ends: 881 [2025-01-09 05:44:47,706 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-01-09 05:44:47,707 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 1466 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:47,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 1548 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:47,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-01-09 05:44:47,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2025-01-09 05:44:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 877 states have (on average 1.847206385404789) internal successors, (1620), 878 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:47,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1620 transitions. [2025-01-09 05:44:47,735 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1620 transitions. Word has length 37 [2025-01-09 05:44:47,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:47,736 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1620 transitions. [2025-01-09 05:44:47,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:47,736 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1620 transitions. [2025-01-09 05:44:47,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 05:44:47,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:47,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:44:47,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:44:47,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:47,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:47,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1602424443, now seen corresponding path program 1 times [2025-01-09 05:44:47,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:47,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781878185] [2025-01-09 05:44:47,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:47,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:47,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 05:44:47,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 05:44:47,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:47,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:47,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:47,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781878185] [2025-01-09 05:44:47,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781878185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:47,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:47,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:44:47,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403556172] [2025-01-09 05:44:47,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:47,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:44:47,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:47,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:44:47,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:44:47,970 INFO L87 Difference]: Start difference. First operand 879 states and 1620 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:48,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:48,065 INFO L93 Difference]: Finished difference Result 984 states and 1780 transitions. [2025-01-09 05:44:48,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:44:48,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 05:44:48,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:48,070 INFO L225 Difference]: With dead ends: 984 [2025-01-09 05:44:48,071 INFO L226 Difference]: Without dead ends: 881 [2025-01-09 05:44:48,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:44:48,072 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 2946 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2946 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:48,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2946 Valid, 1589 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:48,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-01-09 05:44:48,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2025-01-09 05:44:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 877 states have (on average 1.8449258836944127) internal successors, (1618), 878 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:48,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1618 transitions. [2025-01-09 05:44:48,103 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1618 transitions. Word has length 37 [2025-01-09 05:44:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:48,104 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1618 transitions. [2025-01-09 05:44:48,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:48,105 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1618 transitions. [2025-01-09 05:44:48,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 05:44:48,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:48,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:44:48,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:44:48,107 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:48,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:48,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2015794251, now seen corresponding path program 1 times [2025-01-09 05:44:48,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:48,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487297849] [2025-01-09 05:44:48,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:48,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:48,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 05:44:48,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 05:44:48,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:48,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:48,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:48,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:48,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487297849] [2025-01-09 05:44:48,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487297849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:48,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:48,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:44:48,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077379335] [2025-01-09 05:44:48,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:48,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:44:48,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:48,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:44:48,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:44:48,411 INFO L87 Difference]: Start difference. First operand 879 states and 1618 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:48,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:48,489 INFO L93 Difference]: Finished difference Result 887 states and 1627 transitions. [2025-01-09 05:44:48,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:44:48,490 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-01-09 05:44:48,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:48,494 INFO L225 Difference]: With dead ends: 887 [2025-01-09 05:44:48,494 INFO L226 Difference]: Without dead ends: 885 [2025-01-09 05:44:48,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:44:48,495 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 0 mSDsluCounter, 8999 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10501 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:48,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10501 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:48,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-01-09 05:44:48,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2025-01-09 05:44:48,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 883 states have (on average 1.838052095130238) internal successors, (1623), 884 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:48,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1623 transitions. [2025-01-09 05:44:48,584 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1623 transitions. Word has length 38 [2025-01-09 05:44:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:48,584 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1623 transitions. [2025-01-09 05:44:48,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1623 transitions. [2025-01-09 05:44:48,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 05:44:48,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:48,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:44:48,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:44:48,587 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:48,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:48,587 INFO L85 PathProgramCache]: Analyzing trace with hash -59322789, now seen corresponding path program 1 times [2025-01-09 05:44:48,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:48,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896164695] [2025-01-09 05:44:48,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:48,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:48,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 05:44:48,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 05:44:48,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:48,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:48,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:48,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896164695] [2025-01-09 05:44:48,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896164695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:48,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:48,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:44:48,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154818762] [2025-01-09 05:44:48,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:48,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:44:48,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:48,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:44:48,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:44:48,654 INFO L87 Difference]: Start difference. First operand 885 states and 1623 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:48,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:48,686 INFO L93 Difference]: Finished difference Result 1007 states and 1804 transitions. [2025-01-09 05:44:48,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:44:48,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-01-09 05:44:48,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:48,690 INFO L225 Difference]: With dead ends: 1007 [2025-01-09 05:44:48,691 INFO L226 Difference]: Without dead ends: 943 [2025-01-09 05:44:48,691 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-01-09 05:44:48,692 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1476 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:48,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1588 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:48,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-01-09 05:44:48,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 941. [2025-01-09 05:44:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 939 states have (on average 1.8146964856230032) internal successors, (1704), 940 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:48,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1704 transitions. [2025-01-09 05:44:48,713 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1704 transitions. Word has length 39 [2025-01-09 05:44:48,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:48,713 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1704 transitions. [2025-01-09 05:44:48,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:48,714 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1704 transitions. [2025-01-09 05:44:48,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 05:44:48,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:48,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:44:48,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:44:48,715 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:48,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:48,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2020175707, now seen corresponding path program 1 times [2025-01-09 05:44:48,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:48,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949649379] [2025-01-09 05:44:48,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:48,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:48,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 05:44:48,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 05:44:48,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:48,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:48,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:48,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:48,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949649379] [2025-01-09 05:44:48,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949649379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:48,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:48,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:44:48,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82468560] [2025-01-09 05:44:48,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:48,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:44:48,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:48,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:44:48,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:44:48,760 INFO L87 Difference]: Start difference. First operand 941 states and 1704 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:48,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:48,787 INFO L93 Difference]: Finished difference Result 1243 states and 2144 transitions. [2025-01-09 05:44:48,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:44:48,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-01-09 05:44:48,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:48,792 INFO L225 Difference]: With dead ends: 1243 [2025-01-09 05:44:48,793 INFO L226 Difference]: Without dead ends: 1080 [2025-01-09 05:44:48,793 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-01-09 05:44:48,794 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:48,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1594 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:48,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2025-01-09 05:44:48,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1078. [2025-01-09 05:44:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1076 states have (on average 1.762081784386617) internal successors, (1896), 1077 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1896 transitions. [2025-01-09 05:44:48,820 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1896 transitions. Word has length 39 [2025-01-09 05:44:48,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:48,820 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1896 transitions. [2025-01-09 05:44:48,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1896 transitions. [2025-01-09 05:44:48,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 05:44:48,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:48,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:44:48,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:44:48,822 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:48,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:48,822 INFO L85 PathProgramCache]: Analyzing trace with hash -493858725, now seen corresponding path program 1 times [2025-01-09 05:44:48,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:48,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055965487] [2025-01-09 05:44:48,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:48,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:48,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 05:44:48,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 05:44:48,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:48,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:48,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:48,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:48,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055965487] [2025-01-09 05:44:48,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055965487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:48,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:48,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:44:48,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245091873] [2025-01-09 05:44:48,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:48,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:44:48,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:48,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:44:48,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:44:48,865 INFO L87 Difference]: Start difference. First operand 1078 states and 1896 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:48,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:48,895 INFO L93 Difference]: Finished difference Result 1630 states and 2678 transitions. [2025-01-09 05:44:48,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:44:48,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-01-09 05:44:48,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:48,902 INFO L225 Difference]: With dead ends: 1630 [2025-01-09 05:44:48,902 INFO L226 Difference]: Without dead ends: 1330 [2025-01-09 05:44:48,903 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-01-09 05:44:48,903 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1472 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:48,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1596 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:48,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-01-09 05:44:48,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1328. [2025-01-09 05:44:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1326 states have (on average 1.6832579185520362) internal successors, (2232), 1327 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 2232 transitions. [2025-01-09 05:44:48,937 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 2232 transitions. Word has length 39 [2025-01-09 05:44:48,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:48,938 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 2232 transitions. [2025-01-09 05:44:48,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 2232 transitions. [2025-01-09 05:44:48,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 05:44:48,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:48,939 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:44:48,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:44:48,939 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:48,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:48,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1902435240, now seen corresponding path program 1 times [2025-01-09 05:44:48,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:48,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864410633] [2025-01-09 05:44:48,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:48,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:48,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 05:44:48,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 05:44:48,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:48,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:49,053 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:44:49,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:49,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864410633] [2025-01-09 05:44:49,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864410633] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:49,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:49,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:44:49,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087190059] [2025-01-09 05:44:49,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:49,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:44:49,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:49,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:44:49,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:44:49,055 INFO L87 Difference]: Start difference. First operand 1328 states and 2232 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:49,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:49,151 INFO L93 Difference]: Finished difference Result 2960 states and 4508 transitions. [2025-01-09 05:44:49,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:44:49,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-01-09 05:44:49,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:49,163 INFO L225 Difference]: With dead ends: 2960 [2025-01-09 05:44:49,163 INFO L226 Difference]: Without dead ends: 2558 [2025-01-09 05:44:49,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:44:49,165 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 3039 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3039 SdHoareTripleChecker+Valid, 3160 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:49,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3039 Valid, 3160 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:49,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2025-01-09 05:44:49,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 1804. [2025-01-09 05:44:49,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1802 states have (on average 1.602663706992231) internal successors, (2888), 1803 states have internal predecessors, (2888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:49,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2888 transitions. [2025-01-09 05:44:49,222 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2888 transitions. Word has length 54 [2025-01-09 05:44:49,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:49,223 INFO L471 AbstractCegarLoop]: Abstraction has 1804 states and 2888 transitions. [2025-01-09 05:44:49,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:49,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2888 transitions. [2025-01-09 05:44:49,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 05:44:49,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:49,225 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:44:49,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:44:49,225 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:49,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:49,225 INFO L85 PathProgramCache]: Analyzing trace with hash -313033560, now seen corresponding path program 1 times [2025-01-09 05:44:49,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:49,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693371021] [2025-01-09 05:44:49,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:49,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:49,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 05:44:49,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 05:44:49,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:49,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:49,358 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:44:49,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:49,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693371021] [2025-01-09 05:44:49,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693371021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:49,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:49,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:44:49,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117783893] [2025-01-09 05:44:49,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:49,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:44:49,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:49,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:44:49,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:44:49,360 INFO L87 Difference]: Start difference. First operand 1804 states and 2888 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:49,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:49,458 INFO L93 Difference]: Finished difference Result 3508 states and 5268 transitions. [2025-01-09 05:44:49,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:44:49,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-01-09 05:44:49,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:49,469 INFO L225 Difference]: With dead ends: 3508 [2025-01-09 05:44:49,469 INFO L226 Difference]: Without dead ends: 2958 [2025-01-09 05:44:49,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:44:49,471 INFO L435 NwaCegarLoop]: 1547 mSDtfsCounter, 3041 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3041 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:49,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3041 Valid, 3147 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:49,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2025-01-09 05:44:49,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2552. [2025-01-09 05:44:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2550 states have (on average 1.5356862745098039) internal successors, (3916), 2551 states have internal predecessors, (3916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3916 transitions. [2025-01-09 05:44:49,543 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3916 transitions. Word has length 54 [2025-01-09 05:44:49,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:49,543 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3916 transitions. [2025-01-09 05:44:49,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:49,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3916 transitions. [2025-01-09 05:44:49,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 05:44:49,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:49,545 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:44:49,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:44:49,545 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:49,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:49,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1467899304, now seen corresponding path program 1 times [2025-01-09 05:44:49,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:49,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693783174] [2025-01-09 05:44:49,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:49,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:49,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 05:44:49,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 05:44:49,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:49,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:49,637 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 05:44:49,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:49,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693783174] [2025-01-09 05:44:49,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693783174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:49,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:49,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:44:49,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124997703] [2025-01-09 05:44:49,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:49,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:44:49,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:49,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:44:49,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:44:49,639 INFO L87 Difference]: Start difference. First operand 2552 states and 3916 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:49,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:49,743 INFO L93 Difference]: Finished difference Result 4056 states and 6024 transitions. [2025-01-09 05:44:49,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:44:49,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-01-09 05:44:49,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:49,756 INFO L225 Difference]: With dead ends: 4056 [2025-01-09 05:44:49,757 INFO L226 Difference]: Without dead ends: 3506 [2025-01-09 05:44:49,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:44:49,759 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 3047 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3047 SdHoareTripleChecker+Valid, 3153 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:49,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3047 Valid, 3153 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:49,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2025-01-09 05:44:49,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3100. [2025-01-09 05:44:49,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3100 states, 3098 states have (on average 1.5080697224015494) internal successors, (4672), 3099 states have internal predecessors, (4672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:49,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4672 transitions. [2025-01-09 05:44:49,853 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4672 transitions. Word has length 54 [2025-01-09 05:44:49,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:49,854 INFO L471 AbstractCegarLoop]: Abstraction has 3100 states and 4672 transitions. [2025-01-09 05:44:49,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:49,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4672 transitions. [2025-01-09 05:44:49,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 05:44:49,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:49,855 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:44:49,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:44:49,855 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:49,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:49,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1162895185, now seen corresponding path program 1 times [2025-01-09 05:44:49,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:49,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335003191] [2025-01-09 05:44:49,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:49,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:49,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 05:44:49,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 05:44:49,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:49,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:49,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:49,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335003191] [2025-01-09 05:44:49,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335003191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:49,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:49,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:44:49,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847931659] [2025-01-09 05:44:49,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:49,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:44:49,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:49,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:44:49,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:44:49,942 INFO L87 Difference]: Start difference. First operand 3100 states and 4672 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:50,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:50,039 INFO L93 Difference]: Finished difference Result 5424 states and 7882 transitions. [2025-01-09 05:44:50,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:44:50,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-01-09 05:44:50,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:50,050 INFO L225 Difference]: With dead ends: 5424 [2025-01-09 05:44:50,051 INFO L226 Difference]: Without dead ends: 3102 [2025-01-09 05:44:50,053 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-01-09 05:44:50,054 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 29 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3022 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:50,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3022 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:50,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2025-01-09 05:44:50,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 3100. [2025-01-09 05:44:50,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3100 states, 3098 states have (on average 1.4919302775984506) internal successors, (4622), 3099 states have internal predecessors, (4622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4622 transitions. [2025-01-09 05:44:50,130 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4622 transitions. Word has length 55 [2025-01-09 05:44:50,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:50,131 INFO L471 AbstractCegarLoop]: Abstraction has 3100 states and 4622 transitions. [2025-01-09 05:44:50,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:50,131 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4622 transitions. [2025-01-09 05:44:50,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 05:44:50,132 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:50,132 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:44:50,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:44:50,133 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:50,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:50,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1526748416, now seen corresponding path program 1 times [2025-01-09 05:44:50,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:50,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688077047] [2025-01-09 05:44:50,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:50,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:50,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 05:44:50,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 05:44:50,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:50,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:50,207 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:50,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:50,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688077047] [2025-01-09 05:44:50,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688077047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:50,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:50,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:44:50,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705585244] [2025-01-09 05:44:50,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:50,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:44:50,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:50,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:44:50,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:44:50,208 INFO L87 Difference]: Start difference. First operand 3100 states and 4622 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:50,250 INFO L93 Difference]: Finished difference Result 4019 states and 5882 transitions. [2025-01-09 05:44:50,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:44:50,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-01-09 05:44:50,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:50,256 INFO L225 Difference]: With dead ends: 4019 [2025-01-09 05:44:50,257 INFO L226 Difference]: Without dead ends: 1697 [2025-01-09 05:44:50,259 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-01-09 05:44:50,260 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 23 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:50,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3019 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:50,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2025-01-09 05:44:50,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1689. [2025-01-09 05:44:50,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1687 states have (on average 1.5986959098992295) internal successors, (2697), 1688 states have internal predecessors, (2697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:50,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2697 transitions. [2025-01-09 05:44:50,300 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2697 transitions. Word has length 56 [2025-01-09 05:44:50,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:50,300 INFO L471 AbstractCegarLoop]: Abstraction has 1689 states and 2697 transitions. [2025-01-09 05:44:50,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:50,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2697 transitions. [2025-01-09 05:44:50,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 05:44:50,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:50,301 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:44:50,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:44:50,302 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:50,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:50,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1693676737, now seen corresponding path program 1 times [2025-01-09 05:44:50,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:50,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866796408] [2025-01-09 05:44:50,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:50,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:50,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 05:44:50,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 05:44:50,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:50,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:50,373 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:50,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:50,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866796408] [2025-01-09 05:44:50,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866796408] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:50,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:50,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:44:50,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830614536] [2025-01-09 05:44:50,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:50,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:44:50,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:50,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:44:50,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:44:50,375 INFO L87 Difference]: Start difference. First operand 1689 states and 2697 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:50,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:50,403 INFO L93 Difference]: Finished difference Result 2143 states and 3311 transitions. [2025-01-09 05:44:50,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:44:50,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-01-09 05:44:50,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:50,408 INFO L225 Difference]: With dead ends: 2143 [2025-01-09 05:44:50,408 INFO L226 Difference]: Without dead ends: 1241 [2025-01-09 05:44:50,412 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-01-09 05:44:50,413 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 25 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2998 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:50,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2998 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:50,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2025-01-09 05:44:50,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1239. [2025-01-09 05:44:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1237 states have (on average 1.6782538399353275) internal successors, (2076), 1238 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:50,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 2076 transitions. [2025-01-09 05:44:50,443 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 2076 transitions. Word has length 57 [2025-01-09 05:44:50,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:50,444 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 2076 transitions. [2025-01-09 05:44:50,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:50,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2076 transitions. [2025-01-09 05:44:50,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 05:44:50,445 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:50,445 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:44:50,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:44:50,447 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:50,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:50,448 INFO L85 PathProgramCache]: Analyzing trace with hash 443483987, now seen corresponding path program 1 times [2025-01-09 05:44:50,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:50,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132145737] [2025-01-09 05:44:50,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:50,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:50,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 05:44:50,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 05:44:50,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:50,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:51,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:51,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132145737] [2025-01-09 05:44:51,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132145737] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:44:51,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445890113] [2025-01-09 05:44:51,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:51,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:44:51,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:44:51,885 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:44:51,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 05:44:51,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 05:44:51,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 05:44:51,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:51,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:51,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 05:44:51,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:44:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:44:52,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:44:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:44:52,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445890113] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:44:52,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:44:52,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2025-01-09 05:44:52,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142560859] [2025-01-09 05:44:52,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:44:52,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 05:44:52,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:52,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 05:44:52,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-01-09 05:44:52,391 INFO L87 Difference]: Start difference. First operand 1239 states and 2076 transitions. Second operand has 19 states, 19 states have (on average 8.421052631578947) internal successors, (160), 19 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:54,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:54,471 INFO L93 Difference]: Finished difference Result 3541 states and 5099 transitions. [2025-01-09 05:44:54,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-01-09 05:44:54,472 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.421052631578947) internal successors, (160), 19 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-01-09 05:44:54,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:54,484 INFO L225 Difference]: With dead ends: 3541 [2025-01-09 05:44:54,484 INFO L226 Difference]: Without dead ends: 3089 [2025-01-09 05:44:54,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=545, Invalid=2535, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 05:44:54,488 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 15750 mSDsluCounter, 7656 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15750 SdHoareTripleChecker+Valid, 9151 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:54,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15750 Valid, 9151 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:44:54,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2025-01-09 05:44:54,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 2971. [2025-01-09 05:44:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2971 states, 2969 states have (on average 1.4277534523408555) internal successors, (4239), 2970 states have internal predecessors, (4239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:54,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2971 states and 4239 transitions. [2025-01-09 05:44:54,583 INFO L78 Accepts]: Start accepts. Automaton has 2971 states and 4239 transitions. Word has length 59 [2025-01-09 05:44:54,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:54,586 INFO L471 AbstractCegarLoop]: Abstraction has 2971 states and 4239 transitions. [2025-01-09 05:44:54,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.421052631578947) internal successors, (160), 19 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:54,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 4239 transitions. [2025-01-09 05:44:54,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 05:44:54,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:54,588 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:44:54,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 05:44:54,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 05:44:54,789 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:54,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:54,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2095001564, now seen corresponding path program 1 times [2025-01-09 05:44:54,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:54,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551579387] [2025-01-09 05:44:54,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:54,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:54,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 05:44:54,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 05:44:54,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:54,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:56,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:56,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551579387] [2025-01-09 05:44:56,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551579387] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:44:56,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873089403] [2025-01-09 05:44:56,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:56,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:44:56,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:44:56,582 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:44:56,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 05:44:56,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 05:44:56,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 05:44:56,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:56,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:56,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:44:56,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:44:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:57,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:44:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:57,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873089403] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:44:57,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:44:57,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-01-09 05:44:57,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330919546] [2025-01-09 05:44:57,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:44:57,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 05:44:57,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:57,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 05:44:57,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2025-01-09 05:44:57,773 INFO L87 Difference]: Start difference. First operand 2971 states and 4239 transitions. Second operand has 26 states, 26 states have (on average 5.538461538461538) internal successors, (144), 25 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:58,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:58,333 INFO L93 Difference]: Finished difference Result 6894 states and 9256 transitions. [2025-01-09 05:44:58,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 05:44:58,333 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.538461538461538) internal successors, (144), 25 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-01-09 05:44:58,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:58,347 INFO L225 Difference]: With dead ends: 6894 [2025-01-09 05:44:58,348 INFO L226 Difference]: Without dead ends: 5105 [2025-01-09 05:44:58,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=1045, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 05:44:58,352 INFO L435 NwaCegarLoop]: 1491 mSDtfsCounter, 17916 mSDsluCounter, 4651 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17916 SdHoareTripleChecker+Valid, 6142 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:58,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17916 Valid, 6142 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:44:58,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5105 states. [2025-01-09 05:44:58,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5105 to 5039. [2025-01-09 05:44:58,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5039 states, 5037 states have (on average 1.345245185626365) internal successors, (6776), 5038 states have internal predecessors, (6776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:58,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5039 states to 5039 states and 6776 transitions. [2025-01-09 05:44:58,482 INFO L78 Accepts]: Start accepts. Automaton has 5039 states and 6776 transitions. Word has length 60 [2025-01-09 05:44:58,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:58,483 INFO L471 AbstractCegarLoop]: Abstraction has 5039 states and 6776 transitions. [2025-01-09 05:44:58,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.538461538461538) internal successors, (144), 25 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:58,484 INFO L276 IsEmpty]: Start isEmpty. Operand 5039 states and 6776 transitions. [2025-01-09 05:44:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 05:44:58,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:58,485 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:44:58,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 05:44:58,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 05:44:58,686 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:58,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:58,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1511828146, now seen corresponding path program 1 times [2025-01-09 05:44:58,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:58,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448095593] [2025-01-09 05:44:58,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:58,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:58,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 05:44:58,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 05:44:58,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:58,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:58,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:58,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448095593] [2025-01-09 05:44:58,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448095593] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:44:58,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649839303] [2025-01-09 05:44:58,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:58,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:44:58,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:44:58,994 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:44:58,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 05:44:59,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 05:44:59,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 05:44:59,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:59,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:59,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 05:44:59,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:45:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:00,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:45:02,128 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:02,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649839303] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:45:02,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:45:02,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 16] total 38 [2025-01-09 05:45:02,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117714318] [2025-01-09 05:45:02,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:45:02,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 05:45:02,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:02,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 05:45:02,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1249, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 05:45:02,130 INFO L87 Difference]: Start difference. First operand 5039 states and 6776 transitions. Second operand has 38 states, 38 states have (on average 4.157894736842105) internal successors, (158), 38 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:19,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:19,297 INFO L93 Difference]: Finished difference Result 15921 states and 20643 transitions. [2025-01-09 05:45:19,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2025-01-09 05:45:19,298 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.157894736842105) internal successors, (158), 38 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-01-09 05:45:19,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:19,319 INFO L225 Difference]: With dead ends: 15921 [2025-01-09 05:45:19,319 INFO L226 Difference]: Without dead ends: 11980 [2025-01-09 05:45:19,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11495 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=5606, Invalid=24844, Unknown=0, NotChecked=0, Total=30450 [2025-01-09 05:45:19,333 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 19607 mSDsluCounter, 22287 mSDsCounter, 0 mSdLazyCounter, 2096 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19607 SdHoareTripleChecker+Valid, 23830 SdHoareTripleChecker+Invalid, 2202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:19,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19607 Valid, 23830 Invalid, 2202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2096 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 05:45:19,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11980 states. [2025-01-09 05:45:19,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11980 to 9110. [2025-01-09 05:45:19,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9110 states, 9108 states have (on average 1.3072024593763725) internal successors, (11906), 9109 states have internal predecessors, (11906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:19,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9110 states to 9110 states and 11906 transitions. [2025-01-09 05:45:19,656 INFO L78 Accepts]: Start accepts. Automaton has 9110 states and 11906 transitions. Word has length 60 [2025-01-09 05:45:19,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:19,656 INFO L471 AbstractCegarLoop]: Abstraction has 9110 states and 11906 transitions. [2025-01-09 05:45:19,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.157894736842105) internal successors, (158), 38 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:19,656 INFO L276 IsEmpty]: Start isEmpty. Operand 9110 states and 11906 transitions. [2025-01-09 05:45:19,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 05:45:19,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:19,657 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:45:19,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 05:45:19,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:19,858 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:19,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:19,858 INFO L85 PathProgramCache]: Analyzing trace with hash -39676769, now seen corresponding path program 1 times [2025-01-09 05:45:19,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:19,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65120212] [2025-01-09 05:45:19,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:19,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:19,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 05:45:19,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 05:45:19,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:19,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:20,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:20,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65120212] [2025-01-09 05:45:20,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65120212] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:45:20,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966490413] [2025-01-09 05:45:20,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:20,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:20,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:45:20,148 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:45:20,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 05:45:20,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 05:45:20,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 05:45:20,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:20,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:20,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 05:45:20,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:45:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:21,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:45:22,074 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:22,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966490413] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:45:22,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:45:22,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2025-01-09 05:45:22,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029201728] [2025-01-09 05:45:22,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:45:22,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 05:45:22,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:22,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 05:45:22,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2025-01-09 05:45:22,076 INFO L87 Difference]: Start difference. First operand 9110 states and 11906 transitions. Second operand has 27 states, 27 states have (on average 5.888888888888889) internal successors, (159), 26 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:23,467 INFO L93 Difference]: Finished difference Result 18270 states and 23432 transitions. [2025-01-09 05:45:23,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 05:45:23,467 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.888888888888889) internal successors, (159), 26 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-01-09 05:45:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:23,487 INFO L225 Difference]: With dead ends: 18270 [2025-01-09 05:45:23,487 INFO L226 Difference]: Without dead ends: 10620 [2025-01-09 05:45:23,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=628, Invalid=2024, Unknown=0, NotChecked=0, Total=2652 [2025-01-09 05:45:23,497 INFO L435 NwaCegarLoop]: 1511 mSDtfsCounter, 19758 mSDsluCounter, 6419 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19758 SdHoareTripleChecker+Valid, 7930 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:23,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19758 Valid, 7930 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:45:23,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10620 states. [2025-01-09 05:45:23,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10620 to 10152. [2025-01-09 05:45:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10152 states, 10150 states have (on average 1.2829556650246305) internal successors, (13022), 10151 states have internal predecessors, (13022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:23,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10152 states to 10152 states and 13022 transitions. [2025-01-09 05:45:23,866 INFO L78 Accepts]: Start accepts. Automaton has 10152 states and 13022 transitions. Word has length 61 [2025-01-09 05:45:23,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:23,866 INFO L471 AbstractCegarLoop]: Abstraction has 10152 states and 13022 transitions. [2025-01-09 05:45:23,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.888888888888889) internal successors, (159), 26 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:23,866 INFO L276 IsEmpty]: Start isEmpty. Operand 10152 states and 13022 transitions. [2025-01-09 05:45:23,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 05:45:23,867 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:23,867 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:45:23,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 05:45:24,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:24,068 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:24,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:24,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1893660844, now seen corresponding path program 1 times [2025-01-09 05:45:24,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:24,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099384998] [2025-01-09 05:45:24,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:24,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:24,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 05:45:24,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 05:45:24,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:24,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:24,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:24,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099384998] [2025-01-09 05:45:24,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099384998] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:45:24,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896969729] [2025-01-09 05:45:24,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:24,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:24,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:45:24,740 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:45:24,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 05:45:24,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 05:45:24,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 05:45:24,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:24,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:24,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 05:45:24,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:45:26,851 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:26,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:45:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:29,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896969729] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:45:29,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:45:29,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21, 16] total 45 [2025-01-09 05:45:29,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995271168] [2025-01-09 05:45:29,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:45:29,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-01-09 05:45:29,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:29,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-01-09 05:45:29,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1732, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 05:45:29,060 INFO L87 Difference]: Start difference. First operand 10152 states and 13022 transitions. Second operand has 45 states, 45 states have (on average 3.688888888888889) internal successors, (166), 45 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:38,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:38,045 INFO L93 Difference]: Finished difference Result 15852 states and 20164 transitions. [2025-01-09 05:45:38,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-01-09 05:45:38,045 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.688888888888889) internal successors, (166), 45 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-01-09 05:45:38,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:38,064 INFO L225 Difference]: With dead ends: 15852 [2025-01-09 05:45:38,064 INFO L226 Difference]: Without dead ends: 10736 [2025-01-09 05:45:38,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3777 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2761, Invalid=11281, Unknown=0, NotChecked=0, Total=14042 [2025-01-09 05:45:38,073 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 20421 mSDsluCounter, 24336 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20421 SdHoareTripleChecker+Valid, 25862 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:38,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20421 Valid, 25862 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 05:45:38,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10736 states. [2025-01-09 05:45:38,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10736 to 8486. [2025-01-09 05:45:38,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8486 states, 8484 states have (on average 1.2899575671852899) internal successors, (10944), 8485 states have internal predecessors, (10944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:38,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8486 states to 8486 states and 10944 transitions. [2025-01-09 05:45:38,398 INFO L78 Accepts]: Start accepts. Automaton has 8486 states and 10944 transitions. Word has length 62 [2025-01-09 05:45:38,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:38,398 INFO L471 AbstractCegarLoop]: Abstraction has 8486 states and 10944 transitions. [2025-01-09 05:45:38,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.688888888888889) internal successors, (166), 45 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:38,398 INFO L276 IsEmpty]: Start isEmpty. Operand 8486 states and 10944 transitions. [2025-01-09 05:45:38,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:45:38,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:38,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:38,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 05:45:38,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:38,603 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:38,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:38,604 INFO L85 PathProgramCache]: Analyzing trace with hash 369286597, now seen corresponding path program 1 times [2025-01-09 05:45:38,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:38,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069798448] [2025-01-09 05:45:38,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:38,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:38,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:45:38,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:45:38,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:38,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:38,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:38,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:38,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069798448] [2025-01-09 05:45:38,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069798448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:38,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:38,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:45:38,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432194097] [2025-01-09 05:45:38,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:38,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:45:38,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:38,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:45:38,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:45:38,660 INFO L87 Difference]: Start difference. First operand 8486 states and 10944 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 2 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:41,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:41,805 INFO L93 Difference]: Finished difference Result 9990 states and 13817 transitions. [2025-01-09 05:45:41,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:45:41,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 2 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 05:45:41,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:41,812 INFO L225 Difference]: With dead ends: 9990 [2025-01-09 05:45:41,812 INFO L226 Difference]: Without dead ends: 9237 [2025-01-09 05:45:41,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-09 05:45:41,813 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 803 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:41,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 544 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 05:45:41,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9237 states. [2025-01-09 05:45:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9237 to 9237. [2025-01-09 05:45:42,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9237 states, 9235 states have (on average 1.291066594477531) internal successors, (11923), 9236 states have internal predecessors, (11923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9237 states to 9237 states and 11923 transitions. [2025-01-09 05:45:42,130 INFO L78 Accepts]: Start accepts. Automaton has 9237 states and 11923 transitions. Word has length 67 [2025-01-09 05:45:42,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:42,130 INFO L471 AbstractCegarLoop]: Abstraction has 9237 states and 11923 transitions. [2025-01-09 05:45:42,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 2 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:42,131 INFO L276 IsEmpty]: Start isEmpty. Operand 9237 states and 11923 transitions. [2025-01-09 05:45:42,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:45:42,133 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:42,133 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2025-01-09 05:45:42,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 05:45:42,134 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:42,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:42,134 INFO L85 PathProgramCache]: Analyzing trace with hash 761832318, now seen corresponding path program 1 times [2025-01-09 05:45:42,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:42,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372418691] [2025-01-09 05:45:42,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:42,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:42,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:45:42,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:45:42,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:42,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 31 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:42,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:42,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372418691] [2025-01-09 05:45:42,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372418691] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:45:42,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908141791] [2025-01-09 05:45:42,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:42,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:42,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:45:42,829 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:45:42,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 05:45:42,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:45:42,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:45:42,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:42,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:42,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 05:45:42,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:45:43,489 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 26 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:43,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:45:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:44,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908141791] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:45:44,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:45:44,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 35 [2025-01-09 05:45:44,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639672570] [2025-01-09 05:45:44,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:45:44,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 05:45:44,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:44,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 05:45:44,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1083, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 05:45:44,550 INFO L87 Difference]: Start difference. First operand 9237 states and 11923 transitions. Second operand has 35 states, 35 states have (on average 7.685714285714286) internal successors, (269), 35 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:50,845 INFO L93 Difference]: Finished difference Result 28063 states and 35120 transitions. [2025-01-09 05:45:50,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-01-09 05:45:50,845 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 7.685714285714286) internal successors, (269), 35 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-01-09 05:45:50,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:50,865 INFO L225 Difference]: With dead ends: 28063 [2025-01-09 05:45:50,865 INFO L226 Difference]: Without dead ends: 22046 [2025-01-09 05:45:50,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5353 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=3030, Invalid=15060, Unknown=0, NotChecked=0, Total=18090 [2025-01-09 05:45:50,873 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 18937 mSDsluCounter, 19392 mSDsCounter, 0 mSdLazyCounter, 2129 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18937 SdHoareTripleChecker+Valid, 20961 SdHoareTripleChecker+Invalid, 2220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:50,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18937 Valid, 20961 Invalid, 2220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2129 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 05:45:50,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22046 states. [2025-01-09 05:45:51,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22046 to 12616. [2025-01-09 05:45:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12616 states, 12614 states have (on average 1.265657206278738) internal successors, (15965), 12615 states have internal predecessors, (15965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12616 states to 12616 states and 15965 transitions. [2025-01-09 05:45:51,379 INFO L78 Accepts]: Start accepts. Automaton has 12616 states and 15965 transitions. Word has length 100 [2025-01-09 05:45:51,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:51,379 INFO L471 AbstractCegarLoop]: Abstraction has 12616 states and 15965 transitions. [2025-01-09 05:45:51,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.685714285714286) internal successors, (269), 35 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:51,379 INFO L276 IsEmpty]: Start isEmpty. Operand 12616 states and 15965 transitions. [2025-01-09 05:45:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 05:45:51,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:51,382 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 05:45:51,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 05:45:51,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-09 05:45:51,583 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:51,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:51,583 INFO L85 PathProgramCache]: Analyzing trace with hash -59207181, now seen corresponding path program 1 times [2025-01-09 05:45:51,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:51,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92458198] [2025-01-09 05:45:51,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:51,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:51,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 05:45:51,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 05:45:51,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:51,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat