./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label01.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.ufo.UNBOUNDED.pals+Problem12_label01.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 040103cc2656181b384aa80eed05d4be5ba0ae2b5d166dbdcdbf5ae534058d14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:43:08,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:43:08,221 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:43:08,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:43:08,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:43:08,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:43:08,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:43:08,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:43:08,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:43:08,254 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:43:08,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:43:08,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:43:08,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:43:08,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:43:08,255 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:43:08,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:43:08,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:43:08,256 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:43:08,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:43:08,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:43:08,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:43:08,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:43:08,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:43:08,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:43:08,256 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:43:08,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:43:08,256 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:43:08,257 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:43:08,257 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:43:08,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:43:08,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:43:08,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:43:08,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:43:08,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:43:08,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:43:08,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:43:08,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:43:08,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:43:08,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:43:08,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:43:08,258 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:43:08,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:43:08,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:43:08,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:43:08,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:43:08,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:43:08,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:43:08,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:43:08,259 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 -> 040103cc2656181b384aa80eed05d4be5ba0ae2b5d166dbdcdbf5ae534058d14 [2025-01-09 05:43:08,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:43:08,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:43:08,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:43:08,511 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:43:08,511 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:43:08,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-01-09 05:43:09,685 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc23647f1/a99f4f3cab284c78a289ef54e5e354b4/FLAG5336d1a9b [2025-01-09 05:43:10,176 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:43:10,176 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-01-09 05:43:10,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc23647f1/a99f4f3cab284c78a289ef54e5e354b4/FLAG5336d1a9b [2025-01-09 05:43:10,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc23647f1/a99f4f3cab284c78a289ef54e5e354b4 [2025-01-09 05:43:10,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:43:10,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:43:10,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:43:10,264 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:43:10,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:43:10,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:43:10" (1/1) ... [2025-01-09 05:43:10,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154be36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:43:10, skipping insertion in model container [2025-01-09 05:43:10,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:43:10" (1/1) ... [2025-01-09 05:43:10,350 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:43:10,593 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.ufo.UNBOUNDED.pals+Problem12_label01.c[6450,6463] [2025-01-09 05:43:10,643 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.ufo.UNBOUNDED.pals+Problem12_label01.c[12005,12018] [2025-01-09 05:43:11,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:43:11,060 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:43:11,086 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.ufo.UNBOUNDED.pals+Problem12_label01.c[6450,6463] [2025-01-09 05:43:11,096 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.ufo.UNBOUNDED.pals+Problem12_label01.c[12005,12018] [2025-01-09 05:43:11,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:43:11,349 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:43:11,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:43:11 WrapperNode [2025-01-09 05:43:11,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:43:11,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:43:11,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:43:11,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:43:11,357 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:43:11" (1/1) ... [2025-01-09 05:43:11,395 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:43:11" (1/1) ... [2025-01-09 05:43:11,591 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4977 [2025-01-09 05:43:11,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:43:11,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:43:11,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:43:11,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:43:11,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:43:11" (1/1) ... [2025-01-09 05:43:11,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:43:11" (1/1) ... [2025-01-09 05:43:11,672 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:43:11" (1/1) ... [2025-01-09 05:43:11,785 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:43:11,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:43:11" (1/1) ... [2025-01-09 05:43:11,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:43:11" (1/1) ... [2025-01-09 05:43:11,896 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:43:11" (1/1) ... [2025-01-09 05:43:11,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:43:11" (1/1) ... [2025-01-09 05:43:11,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:43:11" (1/1) ... [2025-01-09 05:43:11,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:43:11" (1/1) ... [2025-01-09 05:43:11,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:43:11" (1/1) ... [2025-01-09 05:43:12,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:43:12,017 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:43:12,017 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:43:12,017 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:43:12,018 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:43:11" (1/1) ... [2025-01-09 05:43:12,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:43:12,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:43:12,040 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:43:12,043 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:43:12,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:43:12,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:43:12,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:43:12,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:43:12,128 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:43:12,129 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:43:15,591 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2025-01-09 05:43:15,591 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:43:15,625 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:43:15,626 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 05:43:15,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:43:15 BoogieIcfgContainer [2025-01-09 05:43:15,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:43:15,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:43:15,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:43:15,632 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:43:15,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:43:10" (1/3) ... [2025-01-09 05:43:15,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1719d689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:43:15, skipping insertion in model container [2025-01-09 05:43:15,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:43:11" (2/3) ... [2025-01-09 05:43:15,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1719d689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:43:15, skipping insertion in model container [2025-01-09 05:43:15,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:43:15" (3/3) ... [2025-01-09 05:43:15,636 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-01-09 05:43:15,648 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:43:15,651 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label01.c that has 1 procedures, 873 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:43:15,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:43:15,736 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;@40f33a43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:43:15,736 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:43:15,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 873 states, 870 states have (on average 1.9045977011494253) internal successors, (1657), 872 states have internal predecessors, (1657), 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:43:15,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 05:43:15,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:15,746 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:43:15,746 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:15,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:15,750 INFO L85 PathProgramCache]: Analyzing trace with hash -169677164, now seen corresponding path program 1 times [2025-01-09 05:43:15,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:15,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122675811] [2025-01-09 05:43:15,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:15,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:15,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 05:43:15,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 05:43:15,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:15,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:15,909 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:43:15,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:15,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122675811] [2025-01-09 05:43:15,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122675811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:43:15,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:43:15,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:43:15,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163942687] [2025-01-09 05:43:15,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:43:15,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 05:43:15,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:15,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 05:43:15,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:43:15,939 INFO L87 Difference]: Start difference. First operand has 873 states, 870 states have (on average 1.9045977011494253) internal successors, (1657), 872 states have internal predecessors, (1657), 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:43:16,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:16,012 INFO L93 Difference]: Finished difference Result 1723 states and 3273 transitions. [2025-01-09 05:43:16,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 05:43:16,020 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:43:16,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:16,031 INFO L225 Difference]: With dead ends: 1723 [2025-01-09 05:43:16,031 INFO L226 Difference]: Without dead ends: 808 [2025-01-09 05:43:16,037 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:43:16,038 INFO L435 NwaCegarLoop]: 1591 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, 1591 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:43:16,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:43:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-01-09 05:43:16,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2025-01-09 05:43:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 806 states have (on average 1.8945409429280398) internal successors, (1527), 807 states have internal predecessors, (1527), 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:43:16,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1527 transitions. [2025-01-09 05:43:16,120 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1527 transitions. Word has length 20 [2025-01-09 05:43:16,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:16,121 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1527 transitions. [2025-01-09 05:43:16,121 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:43:16,121 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1527 transitions. [2025-01-09 05:43:16,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 05:43:16,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:16,122 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:43:16,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:43:16,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:16,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:16,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1180794414, now seen corresponding path program 1 times [2025-01-09 05:43:16,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:16,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28017178] [2025-01-09 05:43:16,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:16,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:16,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 05:43:16,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 05:43:16,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:16,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:16,347 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:43:16,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:16,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28017178] [2025-01-09 05:43:16,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28017178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:43:16,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:43:16,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:43:16,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257652412] [2025-01-09 05:43:16,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:43:16,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:43:16,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:16,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:43:16,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:43:16,349 INFO L87 Difference]: Start difference. First operand 808 states and 1527 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:43:16,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:16,453 INFO L93 Difference]: Finished difference Result 844 states and 1581 transitions. [2025-01-09 05:43:16,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:43:16,453 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:43:16,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:16,457 INFO L225 Difference]: With dead ends: 844 [2025-01-09 05:43:16,460 INFO L226 Difference]: Without dead ends: 808 [2025-01-09 05:43:16,460 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:43:16,461 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 0 mSDsluCounter, 4554 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6079 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:43:16,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6079 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:43:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-01-09 05:43:16,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2025-01-09 05:43:16,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 806 states have (on average 1.8746898263027296) internal successors, (1511), 807 states have internal predecessors, (1511), 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:43:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1511 transitions. [2025-01-09 05:43:16,486 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1511 transitions. Word has length 20 [2025-01-09 05:43:16,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:16,487 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1511 transitions. [2025-01-09 05:43:16,487 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:43:16,487 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1511 transitions. [2025-01-09 05:43:16,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 05:43:16,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:16,488 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:43:16,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:43:16,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:16,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:16,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1991326346, now seen corresponding path program 1 times [2025-01-09 05:43:16,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:16,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614038671] [2025-01-09 05:43:16,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:16,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:16,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 05:43:16,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 05:43:16,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:16,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:16,635 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:43:16,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:16,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614038671] [2025-01-09 05:43:16,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614038671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:43:16,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:43:16,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:43:16,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421756800] [2025-01-09 05:43:16,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:43:16,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:43:16,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:16,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:43:16,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:43:16,637 INFO L87 Difference]: Start difference. First operand 808 states and 1511 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:43:16,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:16,741 INFO L93 Difference]: Finished difference Result 1000 states and 1811 transitions. [2025-01-09 05:43:16,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:43:16,742 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:43:16,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:16,747 INFO L225 Difference]: With dead ends: 1000 [2025-01-09 05:43:16,747 INFO L226 Difference]: Without dead ends: 968 [2025-01-09 05:43:16,748 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:43:16,750 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 4644 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4644 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:43:16,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4644 Valid, 1789 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:43:16,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2025-01-09 05:43:16,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 838. [2025-01-09 05:43:16,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 836 states have (on average 1.8636363636363635) internal successors, (1558), 837 states have internal predecessors, (1558), 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:43:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1558 transitions. [2025-01-09 05:43:16,777 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1558 transitions. Word has length 35 [2025-01-09 05:43:16,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:16,777 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1558 transitions. [2025-01-09 05:43:16,777 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:43:16,777 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1558 transitions. [2025-01-09 05:43:16,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 05:43:16,778 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:16,778 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:43:16,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:43:16,779 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:16,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:16,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1054964034, now seen corresponding path program 1 times [2025-01-09 05:43:16,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:16,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850334031] [2025-01-09 05:43:16,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:16,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:16,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 05:43:16,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 05:43:16,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:16,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:16,980 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:43:16,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:16,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850334031] [2025-01-09 05:43:16,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850334031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:43:16,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:43:16,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:43:16,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702507589] [2025-01-09 05:43:16,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:43:16,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:43:16,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:16,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:43:16,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:43:16,982 INFO L87 Difference]: Start difference. First operand 838 states and 1558 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:43:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:17,052 INFO L93 Difference]: Finished difference Result 902 states and 1656 transitions. [2025-01-09 05:43:17,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:43:17,052 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:43:17,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:17,055 INFO L225 Difference]: With dead ends: 902 [2025-01-09 05:43:17,055 INFO L226 Difference]: Without dead ends: 840 [2025-01-09 05:43:17,055 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:43:17,058 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 1478 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:43:17,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 1644 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:43:17,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2025-01-09 05:43:17,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 838. [2025-01-09 05:43:17,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 836 states have (on average 1.86244019138756) internal successors, (1557), 837 states have internal predecessors, (1557), 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:43:17,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1557 transitions. [2025-01-09 05:43:17,078 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1557 transitions. Word has length 37 [2025-01-09 05:43:17,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:17,078 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1557 transitions. [2025-01-09 05:43:17,078 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:43:17,078 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1557 transitions. [2025-01-09 05:43:17,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 05:43:17,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:17,081 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:43:17,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:43:17,082 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:17,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:17,082 INFO L85 PathProgramCache]: Analyzing trace with hash 988470522, now seen corresponding path program 1 times [2025-01-09 05:43:17,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:17,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668998066] [2025-01-09 05:43:17,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:17,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:17,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 05:43:17,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 05:43:17,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:17,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:17,135 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:43:17,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:17,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668998066] [2025-01-09 05:43:17,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668998066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:43:17,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:43:17,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:43:17,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163279797] [2025-01-09 05:43:17,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:43:17,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:43:17,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:17,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:43:17,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:43:17,137 INFO L87 Difference]: Start difference. First operand 838 states and 1557 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:43:17,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:17,165 INFO L93 Difference]: Finished difference Result 951 states and 1730 transitions. [2025-01-09 05:43:17,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:43:17,165 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:43:17,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:17,168 INFO L225 Difference]: With dead ends: 951 [2025-01-09 05:43:17,168 INFO L226 Difference]: Without dead ends: 889 [2025-01-09 05:43:17,168 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:43:17,169 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 1468 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:43:17,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 1550 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:43:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2025-01-09 05:43:17,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 885. [2025-01-09 05:43:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 883 states have (on average 1.8414496036240091) internal successors, (1626), 884 states have internal predecessors, (1626), 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:43:17,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1626 transitions. [2025-01-09 05:43:17,185 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1626 transitions. Word has length 37 [2025-01-09 05:43:17,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:17,186 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1626 transitions. [2025-01-09 05:43:17,186 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:43:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1626 transitions. [2025-01-09 05:43:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 05:43:17,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:17,187 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:43:17,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:43:17,188 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:17,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:17,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2070576533, now seen corresponding path program 1 times [2025-01-09 05:43:17,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:17,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89278446] [2025-01-09 05:43:17,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:17,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:17,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 05:43:17,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 05:43:17,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:17,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:17,369 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:43:17,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:17,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89278446] [2025-01-09 05:43:17,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89278446] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:43:17,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:43:17,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:43:17,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027698108] [2025-01-09 05:43:17,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:43:17,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:43:17,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:17,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:43:17,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:43:17,370 INFO L87 Difference]: Start difference. First operand 885 states and 1626 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:43:17,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:17,426 INFO L93 Difference]: Finished difference Result 893 states and 1635 transitions. [2025-01-09 05:43:17,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:43:17,426 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:43:17,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:17,429 INFO L225 Difference]: With dead ends: 893 [2025-01-09 05:43:17,430 INFO L226 Difference]: Without dead ends: 891 [2025-01-09 05:43:17,431 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:43:17,431 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 0 mSDsluCounter, 9017 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10522 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:43:17,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10522 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:43:17,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2025-01-09 05:43:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 891. [2025-01-09 05:43:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 889 states have (on average 1.8346456692913387) internal successors, (1631), 890 states have internal predecessors, (1631), 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:43:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1631 transitions. [2025-01-09 05:43:17,448 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1631 transitions. Word has length 38 [2025-01-09 05:43:17,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:17,449 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1631 transitions. [2025-01-09 05:43:17,449 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:43:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1631 transitions. [2025-01-09 05:43:17,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 05:43:17,450 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:17,450 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:43:17,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:43:17,451 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:17,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:17,451 INFO L85 PathProgramCache]: Analyzing trace with hash -103267006, now seen corresponding path program 1 times [2025-01-09 05:43:17,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:17,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410207392] [2025-01-09 05:43:17,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:17,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:17,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 05:43:17,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 05:43:17,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:17,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:17,494 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:43:17,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:17,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410207392] [2025-01-09 05:43:17,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410207392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:43:17,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:43:17,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:43:17,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848862828] [2025-01-09 05:43:17,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:43:17,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:43:17,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:17,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:43:17,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:43:17,496 INFO L87 Difference]: Start difference. First operand 891 states and 1631 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:43:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:17,519 INFO L93 Difference]: Finished difference Result 1105 states and 1943 transitions. [2025-01-09 05:43:17,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:43:17,520 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:43:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:17,523 INFO L225 Difference]: With dead ends: 1105 [2025-01-09 05:43:17,523 INFO L226 Difference]: Without dead ends: 990 [2025-01-09 05:43:17,523 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:43:17,523 INFO L435 NwaCegarLoop]: 1538 mSDtfsCounter, 1477 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 1593 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:43:17,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 1593 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:43:17,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-01-09 05:43:17,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 988. [2025-01-09 05:43:17,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 986 states have (on average 1.793103448275862) internal successors, (1768), 987 states have internal predecessors, (1768), 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:43:17,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1768 transitions. [2025-01-09 05:43:17,540 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1768 transitions. Word has length 39 [2025-01-09 05:43:17,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:17,540 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1768 transitions. [2025-01-09 05:43:17,540 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:43:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1768 transitions. [2025-01-09 05:43:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 05:43:17,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:17,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, 1, 1] [2025-01-09 05:43:17,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:43:17,542 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:17,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:17,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1677665858, now seen corresponding path program 1 times [2025-01-09 05:43:17,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:17,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166695627] [2025-01-09 05:43:17,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:17,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:17,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 05:43:17,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 05:43:17,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:17,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:17,590 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:43:17,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:17,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166695627] [2025-01-09 05:43:17,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166695627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:43:17,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:43:17,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:43:17,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716991071] [2025-01-09 05:43:17,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:43:17,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:43:17,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:17,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:43:17,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:43:17,592 INFO L87 Difference]: Start difference. First operand 988 states and 1768 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:43:17,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:17,614 INFO L93 Difference]: Finished difference Result 1380 states and 2326 transitions. [2025-01-09 05:43:17,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:43:17,615 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:43:17,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:17,618 INFO L225 Difference]: With dead ends: 1380 [2025-01-09 05:43:17,619 INFO L226 Difference]: Without dead ends: 1168 [2025-01-09 05:43:17,619 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:43:17,619 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 1475 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1595 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:43:17,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1595 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:43:17,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2025-01-09 05:43:17,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1166. [2025-01-09 05:43:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 1164 states have (on average 1.7268041237113403) internal successors, (2010), 1165 states have internal predecessors, (2010), 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:43:17,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 2010 transitions. [2025-01-09 05:43:17,642 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 2010 transitions. Word has length 39 [2025-01-09 05:43:17,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:17,643 INFO L471 AbstractCegarLoop]: Abstraction has 1166 states and 2010 transitions. [2025-01-09 05:43:17,643 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:43:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 2010 transitions. [2025-01-09 05:43:17,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 05:43:17,644 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:17,646 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] [2025-01-09 05:43:17,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:43:17,647 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:17,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:17,647 INFO L85 PathProgramCache]: Analyzing trace with hash 599493661, now seen corresponding path program 1 times [2025-01-09 05:43:17,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:17,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034423040] [2025-01-09 05:43:17,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:17,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:17,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 05:43:17,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 05:43:17,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:17,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:17,683 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:43:17,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:17,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034423040] [2025-01-09 05:43:17,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034423040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:43:17,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:43:17,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:43:17,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477868379] [2025-01-09 05:43:17,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:43:17,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:43:17,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:17,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:43:17,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:43:17,684 INFO L87 Difference]: Start difference. First operand 1166 states and 2010 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:43:17,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:17,707 INFO L93 Difference]: Finished difference Result 1589 states and 2616 transitions. [2025-01-09 05:43:17,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:43:17,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 41 [2025-01-09 05:43:17,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:17,712 INFO L225 Difference]: With dead ends: 1589 [2025-01-09 05:43:17,712 INFO L226 Difference]: Without dead ends: 1354 [2025-01-09 05:43:17,713 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:43:17,715 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 1476 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 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:43:17,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 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:43:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2025-01-09 05:43:17,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2025-01-09 05:43:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1350 states have (on average 1.677037037037037) internal successors, (2264), 1351 states have internal predecessors, (2264), 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:43:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2264 transitions. [2025-01-09 05:43:17,737 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2264 transitions. Word has length 41 [2025-01-09 05:43:17,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:17,738 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 2264 transitions. [2025-01-09 05:43:17,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:43:17,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2264 transitions. [2025-01-09 05:43:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:43:17,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:17,738 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] [2025-01-09 05:43:17,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:43:17,739 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:17,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:17,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1144874736, now seen corresponding path program 1 times [2025-01-09 05:43:17,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:17,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407346127] [2025-01-09 05:43:17,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:17,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:17,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:43:17,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:43:17,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:17,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:17,794 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:43:17,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:17,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407346127] [2025-01-09 05:43:17,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407346127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:43:17,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:43:17,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:43:17,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638683788] [2025-01-09 05:43:17,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:43:17,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:43:17,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:17,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:43:17,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:43:17,794 INFO L87 Difference]: Start difference. First operand 1352 states and 2264 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 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:43:20,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:20,485 INFO L93 Difference]: Finished difference Result 2856 states and 5137 transitions. [2025-01-09 05:43:20,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:43:20,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 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 48 [2025-01-09 05:43:20,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:20,492 INFO L225 Difference]: With dead ends: 2856 [2025-01-09 05:43:20,492 INFO L226 Difference]: Without dead ends: 2103 [2025-01-09 05:43:20,493 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:43:20,494 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 839 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:43:20,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 149 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 05:43:20,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2025-01-09 05:43:20,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 2103. [2025-01-09 05:43:20,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2103 states, 2101 states have (on average 1.732032365540219) internal successors, (3639), 2102 states have internal predecessors, (3639), 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:43:20,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 3639 transitions. [2025-01-09 05:43:20,530 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 3639 transitions. Word has length 48 [2025-01-09 05:43:20,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:20,530 INFO L471 AbstractCegarLoop]: Abstraction has 2103 states and 3639 transitions. [2025-01-09 05:43:20,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 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:43:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 3639 transitions. [2025-01-09 05:43:20,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 05:43:20,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:20,531 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:43:20,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:43:20,531 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:20,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:20,532 INFO L85 PathProgramCache]: Analyzing trace with hash -522911569, now seen corresponding path program 1 times [2025-01-09 05:43:20,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:20,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293675613] [2025-01-09 05:43:20,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:20,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:20,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 05:43:20,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 05:43:20,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:20,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:20,631 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:43:20,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:20,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293675613] [2025-01-09 05:43:20,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293675613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:43:20,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:43:20,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:43:20,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286803939] [2025-01-09 05:43:20,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:43:20,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:43:20,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:20,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:43:20,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:43:20,632 INFO L87 Difference]: Start difference. First operand 2103 states and 3639 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:43:20,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:20,710 INFO L93 Difference]: Finished difference Result 3959 states and 6219 transitions. [2025-01-09 05:43:20,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:43:20,710 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:43:20,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:20,719 INFO L225 Difference]: With dead ends: 3959 [2025-01-09 05:43:20,719 INFO L226 Difference]: Without dead ends: 3385 [2025-01-09 05:43:20,722 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:43:20,723 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 3050 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3050 SdHoareTripleChecker+Valid, 3171 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:43:20,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3050 Valid, 3171 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:43:20,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2025-01-09 05:43:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 2675. [2025-01-09 05:43:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2675 states, 2673 states have (on average 1.6561915450804339) internal successors, (4427), 2674 states have internal predecessors, (4427), 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:43:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 4427 transitions. [2025-01-09 05:43:20,770 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 4427 transitions. Word has length 54 [2025-01-09 05:43:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:20,770 INFO L471 AbstractCegarLoop]: Abstraction has 2675 states and 4427 transitions. [2025-01-09 05:43:20,770 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:43:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 4427 transitions. [2025-01-09 05:43:20,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 05:43:20,771 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:20,771 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:43:20,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:43:20,771 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:20,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:20,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1258021295, now seen corresponding path program 1 times [2025-01-09 05:43:20,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:20,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948923213] [2025-01-09 05:43:20,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:20,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:20,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 05:43:20,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 05:43:20,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:20,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:20,854 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:43:20,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:20,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948923213] [2025-01-09 05:43:20,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948923213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:43:20,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:43:20,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:43:20,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066813456] [2025-01-09 05:43:20,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:43:20,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:43:20,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:20,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:43:20,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:43:20,855 INFO L87 Difference]: Start difference. First operand 2675 states and 4427 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:43:20,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:20,921 INFO L93 Difference]: Finished difference Result 4531 states and 7007 transitions. [2025-01-09 05:43:20,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:43:20,922 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:43:20,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:20,932 INFO L225 Difference]: With dead ends: 4531 [2025-01-09 05:43:20,933 INFO L226 Difference]: Without dead ends: 3957 [2025-01-09 05:43:20,935 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:43:20,935 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 3059 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3059 SdHoareTripleChecker+Valid, 3148 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:43:20,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3059 Valid, 3148 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:43:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3957 states. [2025-01-09 05:43:20,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3957 to 3535. [2025-01-09 05:43:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3535 states, 3533 states have (on average 1.5847721483158788) internal successors, (5599), 3534 states have internal predecessors, (5599), 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:43:20,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3535 states to 3535 states and 5599 transitions. [2025-01-09 05:43:20,994 INFO L78 Accepts]: Start accepts. Automaton has 3535 states and 5599 transitions. Word has length 54 [2025-01-09 05:43:20,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:20,995 INFO L471 AbstractCegarLoop]: Abstraction has 3535 states and 5599 transitions. [2025-01-09 05:43:20,995 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:43:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3535 states and 5599 transitions. [2025-01-09 05:43:20,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 05:43:20,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:20,996 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:43:20,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:43:20,996 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:20,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:20,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1356051929, now seen corresponding path program 1 times [2025-01-09 05:43:20,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:20,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000637808] [2025-01-09 05:43:20,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:20,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:21,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 05:43:21,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 05:43:21,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:21,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:21,061 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:43:21,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:21,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000637808] [2025-01-09 05:43:21,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000637808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:43:21,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:43:21,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:43:21,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661694770] [2025-01-09 05:43:21,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:43:21,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:43:21,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:21,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:43:21,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:43:21,063 INFO L87 Difference]: Start difference. First operand 3535 states and 5599 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:43:21,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:21,092 INFO L93 Difference]: Finished difference Result 5011 states and 7662 transitions. [2025-01-09 05:43:21,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:43:21,093 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:43:21,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:21,101 INFO L225 Difference]: With dead ends: 5011 [2025-01-09 05:43:21,101 INFO L226 Difference]: Without dead ends: 3005 [2025-01-09 05:43:21,103 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:43:21,104 INFO L435 NwaCegarLoop]: 1535 mSDtfsCounter, 34 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3031 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:43:21,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3031 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:43:21,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2025-01-09 05:43:21,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 3003. [2025-01-09 05:43:21,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3003 states, 3001 states have (on average 1.623125624791736) internal successors, (4871), 3002 states have internal predecessors, (4871), 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:43:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 3003 states and 4871 transitions. [2025-01-09 05:43:21,149 INFO L78 Accepts]: Start accepts. Automaton has 3003 states and 4871 transitions. Word has length 56 [2025-01-09 05:43:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:21,149 INFO L471 AbstractCegarLoop]: Abstraction has 3003 states and 4871 transitions. [2025-01-09 05:43:21,149 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:43:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3003 states and 4871 transitions. [2025-01-09 05:43:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 05:43:21,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:21,150 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] [2025-01-09 05:43:21,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:43:21,150 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:21,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:21,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1047994442, now seen corresponding path program 1 times [2025-01-09 05:43:21,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:21,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985698612] [2025-01-09 05:43:21,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:21,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:21,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 05:43:21,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 05:43:21,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:21,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:21,216 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:43:21,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:21,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985698612] [2025-01-09 05:43:21,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985698612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:43:21,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:43:21,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:43:21,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701563810] [2025-01-09 05:43:21,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:43:21,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:43:21,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:21,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:43:21,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:43:21,217 INFO L87 Difference]: Start difference. First operand 3003 states and 4871 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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:43:21,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:21,287 INFO L93 Difference]: Finished difference Result 4259 states and 6627 transitions. [2025-01-09 05:43:21,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:43:21,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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 56 [2025-01-09 05:43:21,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:21,297 INFO L225 Difference]: With dead ends: 4259 [2025-01-09 05:43:21,297 INFO L226 Difference]: Without dead ends: 3841 [2025-01-09 05:43:21,299 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:43:21,300 INFO L435 NwaCegarLoop]: 1550 mSDtfsCounter, 3049 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3049 SdHoareTripleChecker+Valid, 3182 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:43:21,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3049 Valid, 3182 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:43:21,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states. [2025-01-09 05:43:21,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 3419. [2025-01-09 05:43:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 3417 states have (on average 1.5940883816213052) internal successors, (5447), 3418 states have internal predecessors, (5447), 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:43:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5447 transitions. [2025-01-09 05:43:21,373 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5447 transitions. Word has length 56 [2025-01-09 05:43:21,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:21,373 INFO L471 AbstractCegarLoop]: Abstraction has 3419 states and 5447 transitions. [2025-01-09 05:43:21,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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:43:21,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5447 transitions. [2025-01-09 05:43:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 05:43:21,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:21,375 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, 1, 1] [2025-01-09 05:43:21,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:43:21,375 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:21,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:21,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1880756140, now seen corresponding path program 1 times [2025-01-09 05:43:21,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:21,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863172874] [2025-01-09 05:43:21,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:21,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:21,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 05:43:21,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 05:43:21,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:21,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:21,450 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:43:21,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:21,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863172874] [2025-01-09 05:43:21,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863172874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:43:21,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:43:21,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:43:21,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410033331] [2025-01-09 05:43:21,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:43:21,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:43:21,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:21,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:43:21,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:43:21,451 INFO L87 Difference]: Start difference. First operand 3419 states and 5447 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:43:21,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:21,518 INFO L93 Difference]: Finished difference Result 4359 states and 6745 transitions. [2025-01-09 05:43:21,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:43:21,519 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:43:21,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:21,525 INFO L225 Difference]: With dead ends: 4359 [2025-01-09 05:43:21,525 INFO L226 Difference]: Without dead ends: 2485 [2025-01-09 05:43:21,528 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:43:21,528 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 29 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3016 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:43:21,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3016 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:43:21,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2025-01-09 05:43:21,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2483. [2025-01-09 05:43:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 2481 states have (on average 1.6658605401047966) internal successors, (4133), 2482 states have internal predecessors, (4133), 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:43:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 4133 transitions. [2025-01-09 05:43:21,565 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 4133 transitions. Word has length 57 [2025-01-09 05:43:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:21,565 INFO L471 AbstractCegarLoop]: Abstraction has 2483 states and 4133 transitions. [2025-01-09 05:43:21,565 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:43:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 4133 transitions. [2025-01-09 05:43:21,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 05:43:21,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:21,566 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] [2025-01-09 05:43:21,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:43:21,567 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:21,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:21,567 INFO L85 PathProgramCache]: Analyzing trace with hash -975933434, now seen corresponding path program 1 times [2025-01-09 05:43:21,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:21,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197058716] [2025-01-09 05:43:21,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:21,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:21,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 05:43:21,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 05:43:21,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:21,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:21,622 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:43:21,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:21,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197058716] [2025-01-09 05:43:21,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197058716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:43:21,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:43:21,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:43:21,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797059294] [2025-01-09 05:43:21,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:43:21,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:43:21,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:21,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:43:21,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:43:21,624 INFO L87 Difference]: Start difference. First operand 2483 states and 4133 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:43:21,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:21,642 INFO L93 Difference]: Finished difference Result 2955 states and 4774 transitions. [2025-01-09 05:43:21,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:43:21,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:43:21,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:21,647 INFO L225 Difference]: With dead ends: 2955 [2025-01-09 05:43:21,647 INFO L226 Difference]: Without dead ends: 2017 [2025-01-09 05:43:21,648 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:43:21,649 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 26 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3001 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:43:21,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3001 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:43:21,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2025-01-09 05:43:21,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 2015. [2025-01-09 05:43:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 2013 states have (on average 1.7312468951813214) internal successors, (3485), 2014 states have internal predecessors, (3485), 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:43:21,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 3485 transitions. [2025-01-09 05:43:21,675 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 3485 transitions. Word has length 59 [2025-01-09 05:43:21,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:21,675 INFO L471 AbstractCegarLoop]: Abstraction has 2015 states and 3485 transitions. [2025-01-09 05:43:21,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:43:21,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 3485 transitions. [2025-01-09 05:43:21,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 05:43:21,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:21,676 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, 1, 1] [2025-01-09 05:43:21,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:43:21,677 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:21,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:21,677 INFO L85 PathProgramCache]: Analyzing trace with hash -956414408, now seen corresponding path program 1 times [2025-01-09 05:43:21,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:21,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519242117] [2025-01-09 05:43:21,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:21,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:21,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 05:43:21,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 05:43:21,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:21,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:22,634 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:43:22,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:22,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519242117] [2025-01-09 05:43:22,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519242117] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:43:22,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199256215] [2025-01-09 05:43:22,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:22,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:43:22,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:43:22,637 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:43:22,639 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:43:22,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 05:43:22,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 05:43:22,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:22,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:22,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 05:43:22,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:43:22,908 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:43:22,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:43:23,085 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:43:23,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199256215] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:43:23,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:43:23,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2025-01-09 05:43:23,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869924860] [2025-01-09 05:43:23,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:43:23,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 05:43:23,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:23,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 05:43:23,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-01-09 05:43:23,088 INFO L87 Difference]: Start difference. First operand 2015 states and 3485 transitions. Second operand has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 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:43:24,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:24,647 INFO L93 Difference]: Finished difference Result 4416 states and 6659 transitions. [2025-01-09 05:43:24,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-01-09 05:43:24,648 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 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 61 [2025-01-09 05:43:24,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:24,656 INFO L225 Difference]: With dead ends: 4416 [2025-01-09 05:43:24,656 INFO L226 Difference]: Without dead ends: 3946 [2025-01-09 05:43:24,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=545, Invalid=2535, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 05:43:24,662 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 12838 mSDsluCounter, 7752 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12838 SdHoareTripleChecker+Valid, 9251 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:43:24,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12838 Valid, 9251 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:43:24,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2025-01-09 05:43:24,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3912. [2025-01-09 05:43:24,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3912 states, 3910 states have (on average 1.4910485933503836) internal successors, (5830), 3911 states have internal predecessors, (5830), 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:43:24,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3912 states and 5830 transitions. [2025-01-09 05:43:24,723 INFO L78 Accepts]: Start accepts. Automaton has 3912 states and 5830 transitions. Word has length 61 [2025-01-09 05:43:24,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:24,723 INFO L471 AbstractCegarLoop]: Abstraction has 3912 states and 5830 transitions. [2025-01-09 05:43:24,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 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:43:24,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3912 states and 5830 transitions. [2025-01-09 05:43:24,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 05:43:24,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:24,724 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:43:24,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 05:43:24,924 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,SelfDestructingSolverStorable16 [2025-01-09 05:43:24,925 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:24,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:24,925 INFO L85 PathProgramCache]: Analyzing trace with hash 434677662, now seen corresponding path program 1 times [2025-01-09 05:43:24,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:24,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981035957] [2025-01-09 05:43:24,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:24,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:24,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 05:43:24,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 05:43:24,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:24,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:25,234 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:43:25,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:25,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981035957] [2025-01-09 05:43:25,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981035957] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:43:25,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994808250] [2025-01-09 05:43:25,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:25,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:43:25,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:43:25,237 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:43:25,239 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:43:25,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 05:43:25,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 05:43:25,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:25,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:25,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:43:25,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:43:25,655 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:43:25,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:43:26,071 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:43:26,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994808250] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:43:26,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:43:26,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-01-09 05:43:26,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843070851] [2025-01-09 05:43:26,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:43:26,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 05:43:26,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:26,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 05:43:26,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-01-09 05:43:26,073 INFO L87 Difference]: Start difference. First operand 3912 states and 5830 transitions. Second operand has 23 states, 23 states have (on average 5.913043478260869) internal successors, (136), 22 states have internal predecessors, (136), 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:43:26,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:26,429 INFO L93 Difference]: Finished difference Result 8181 states and 11245 transitions. [2025-01-09 05:43:26,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:43:26,429 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.913043478260869) internal successors, (136), 22 states have internal predecessors, (136), 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:43:26,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:26,440 INFO L225 Difference]: With dead ends: 8181 [2025-01-09 05:43:26,440 INFO L226 Difference]: Without dead ends: 6222 [2025-01-09 05:43:26,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=787, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 05:43:26,444 INFO L435 NwaCegarLoop]: 1497 mSDtfsCounter, 16561 mSDsluCounter, 3109 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16561 SdHoareTripleChecker+Valid, 4606 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:43:26,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16561 Valid, 4606 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:43:26,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6222 states. [2025-01-09 05:43:26,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6222 to 6156. [2025-01-09 05:43:26,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6156 states, 6154 states have (on average 1.3924276893077674) internal successors, (8569), 6155 states have internal predecessors, (8569), 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:43:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6156 states to 6156 states and 8569 transitions. [2025-01-09 05:43:26,547 INFO L78 Accepts]: Start accepts. Automaton has 6156 states and 8569 transitions. Word has length 62 [2025-01-09 05:43:26,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:26,548 INFO L471 AbstractCegarLoop]: Abstraction has 6156 states and 8569 transitions. [2025-01-09 05:43:26,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.913043478260869) internal successors, (136), 22 states have internal predecessors, (136), 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:43:26,548 INFO L276 IsEmpty]: Start isEmpty. Operand 6156 states and 8569 transitions. [2025-01-09 05:43:26,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 05:43:26,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:26,549 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, 1, 1] [2025-01-09 05:43:26,555 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:43:26,749 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,SelfDestructingSolverStorable17 [2025-01-09 05:43:26,750 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:26,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash 854854928, now seen corresponding path program 1 times [2025-01-09 05:43:26,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:26,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638930342] [2025-01-09 05:43:26,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:26,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:26,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 05:43:26,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 05:43:26,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:26,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:26,985 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:43:26,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:26,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638930342] [2025-01-09 05:43:26,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638930342] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:43:26,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144275424] [2025-01-09 05:43:26,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:26,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:43:26,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:43:26,987 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:43:26,990 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:43:27,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 05:43:27,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 05:43:27,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:27,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:27,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 05:43:27,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:43:27,384 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:43:27,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:43:27,753 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:43:27,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144275424] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:43:27,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:43:27,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-01-09 05:43:27,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935674556] [2025-01-09 05:43:27,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:43:27,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 05:43:27,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:27,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 05:43:27,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-01-09 05:43:27,754 INFO L87 Difference]: Start difference. First operand 6156 states and 8569 transitions. Second operand has 23 states, 23 states have (on average 6.260869565217392) internal successors, (144), 22 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:43:28,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:28,165 INFO L93 Difference]: Finished difference Result 10311 states and 13756 transitions. [2025-01-09 05:43:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:43:28,165 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.260869565217392) internal successors, (144), 22 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 62 [2025-01-09 05:43:28,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:28,175 INFO L225 Difference]: With dead ends: 10311 [2025-01-09 05:43:28,176 INFO L226 Difference]: Without dead ends: 6364 [2025-01-09 05:43:28,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 05:43:28,181 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 9329 mSDsluCounter, 3325 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9329 SdHoareTripleChecker+Valid, 4818 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:43:28,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9329 Valid, 4818 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:43:28,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6364 states. [2025-01-09 05:43:28,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6364 to 5798. [2025-01-09 05:43:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5798 states, 5796 states have (on average 1.393719806763285) internal successors, (8078), 5797 states have internal predecessors, (8078), 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:43:28,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5798 states to 5798 states and 8078 transitions. [2025-01-09 05:43:28,272 INFO L78 Accepts]: Start accepts. Automaton has 5798 states and 8078 transitions. Word has length 62 [2025-01-09 05:43:28,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:28,272 INFO L471 AbstractCegarLoop]: Abstraction has 5798 states and 8078 transitions. [2025-01-09 05:43:28,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.260869565217392) internal successors, (144), 22 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:43:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 5798 states and 8078 transitions. [2025-01-09 05:43:28,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 05:43:28,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:28,273 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, 1, 1] [2025-01-09 05:43:28,279 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:43:28,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:43:28,477 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:28,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:28,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1959005424, now seen corresponding path program 1 times [2025-01-09 05:43:28,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:28,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280616818] [2025-01-09 05:43:28,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:28,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:28,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 05:43:28,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 05:43:28,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:28,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:28,764 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:43:28,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:28,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280616818] [2025-01-09 05:43:28,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280616818] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:43:28,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719745206] [2025-01-09 05:43:28,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:28,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:43:28,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:43:28,770 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:43:28,772 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:43:28,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 05:43:28,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 05:43:28,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:28,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:28,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:43:28,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:43:29,105 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:43:29,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:43:29,618 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:43:29,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719745206] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:43:29,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:43:29,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-01-09 05:43:29,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033652302] [2025-01-09 05:43:29,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:43:29,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 05:43:29,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:29,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 05:43:29,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2025-01-09 05:43:29,620 INFO L87 Difference]: Start difference. First operand 5798 states and 8078 transitions. Second operand has 22 states, 22 states have (on average 6.0) internal successors, (132), 21 states have internal predecessors, (132), 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:43:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:29,980 INFO L93 Difference]: Finished difference Result 13105 states and 17058 transitions. [2025-01-09 05:43:29,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 05:43:29,980 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.0) internal successors, (132), 21 states have internal predecessors, (132), 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:43:29,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:29,994 INFO L225 Difference]: With dead ends: 13105 [2025-01-09 05:43:29,994 INFO L226 Difference]: Without dead ends: 9467 [2025-01-09 05:43:29,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=665, Unknown=0, NotChecked=0, Total=870 [2025-01-09 05:43:30,000 INFO L435 NwaCegarLoop]: 1496 mSDtfsCounter, 13521 mSDsluCounter, 4715 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13521 SdHoareTripleChecker+Valid, 6211 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:43:30,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13521 Valid, 6211 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:43:30,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9467 states. [2025-01-09 05:43:30,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9467 to 9463. [2025-01-09 05:43:30,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9463 states, 9461 states have (on average 1.3221646760384738) internal successors, (12509), 9462 states have internal predecessors, (12509), 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:43:30,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9463 states to 9463 states and 12509 transitions. [2025-01-09 05:43:30,205 INFO L78 Accepts]: Start accepts. Automaton has 9463 states and 12509 transitions. Word has length 62 [2025-01-09 05:43:30,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:30,205 INFO L471 AbstractCegarLoop]: Abstraction has 9463 states and 12509 transitions. [2025-01-09 05:43:30,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.0) internal successors, (132), 21 states have internal predecessors, (132), 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:43:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 9463 states and 12509 transitions. [2025-01-09 05:43:30,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 05:43:30,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:30,207 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, 1, 1, 1] [2025-01-09 05:43:30,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 05:43:30,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:43:30,408 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:30,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:30,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1716111546, now seen corresponding path program 1 times [2025-01-09 05:43:30,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:30,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750893141] [2025-01-09 05:43:30,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:30,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:30,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 05:43:30,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 05:43:30,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:30,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:31,434 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:43:31,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:31,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750893141] [2025-01-09 05:43:31,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750893141] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:43:31,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861266258] [2025-01-09 05:43:31,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:31,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:43:31,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:43:31,437 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:43:31,438 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:43:31,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 05:43:31,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 05:43:31,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:31,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:31,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 05:43:31,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:43:32,126 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:43:32,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:43:32,778 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:43:32,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861266258] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:43:32,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:43:32,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 40 [2025-01-09 05:43:32,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010789681] [2025-01-09 05:43:32,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:43:32,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-01-09 05:43:32,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:32,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-09 05:43:32,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1431, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 05:43:32,779 INFO L87 Difference]: Start difference. First operand 9463 states and 12509 transitions. Second operand has 40 states, 40 states have (on average 4.175) internal successors, (167), 40 states have internal predecessors, (167), 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:43:40,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:40,482 INFO L93 Difference]: Finished difference Result 21578 states and 27314 transitions. [2025-01-09 05:43:40,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2025-01-09 05:43:40,483 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 4.175) internal successors, (167), 40 states have internal predecessors, (167), 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 63 [2025-01-09 05:43:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:40,502 INFO L225 Difference]: With dead ends: 21578 [2025-01-09 05:43:40,502 INFO L226 Difference]: Without dead ends: 17324 [2025-01-09 05:43:40,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6094 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=3895, Invalid=15011, Unknown=0, NotChecked=0, Total=18906 [2025-01-09 05:43:40,511 INFO L435 NwaCegarLoop]: 1588 mSDtfsCounter, 14661 mSDsluCounter, 27503 mSDsCounter, 0 mSdLazyCounter, 2107 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14661 SdHoareTripleChecker+Valid, 29091 SdHoareTripleChecker+Invalid, 2196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:43:40,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14661 Valid, 29091 Invalid, 2196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 2107 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 05:43:40,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17324 states. [2025-01-09 05:43:40,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17324 to 8161. [2025-01-09 05:43:40,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8161 states, 8159 states have (on average 1.3369285451648487) internal successors, (10908), 8160 states have internal predecessors, (10908), 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:43:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8161 states to 8161 states and 10908 transitions. [2025-01-09 05:43:40,923 INFO L78 Accepts]: Start accepts. Automaton has 8161 states and 10908 transitions. Word has length 63 [2025-01-09 05:43:40,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:40,923 INFO L471 AbstractCegarLoop]: Abstraction has 8161 states and 10908 transitions. [2025-01-09 05:43:40,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.175) internal successors, (167), 40 states have internal predecessors, (167), 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:43:40,924 INFO L276 IsEmpty]: Start isEmpty. Operand 8161 states and 10908 transitions. [2025-01-09 05:43:40,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 05:43:40,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:40,925 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, 1, 1] [2025-01-09 05:43:40,932 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:43:41,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:43:41,125 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:41,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:41,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1653026510, now seen corresponding path program 1 times [2025-01-09 05:43:41,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:41,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639672570] [2025-01-09 05:43:41,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:41,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:41,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 05:43:41,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 05:43:41,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:41,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:41,714 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:43:41,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:41,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639672570] [2025-01-09 05:43:41,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639672570] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:43:41,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284980192] [2025-01-09 05:43:41,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:41,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:43:41,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:43:41,718 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:43:41,718 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:43:41,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 05:43:41,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 05:43:41,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:41,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:41,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 05:43:41,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:43:42,269 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:43:42,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:43:43,149 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:43:43,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284980192] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:43:43,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:43:43,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 39 [2025-01-09 05:43:43,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206016589] [2025-01-09 05:43:43,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:43:43,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 05:43:43,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:43,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 05:43:43,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1363, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 05:43:43,151 INFO L87 Difference]: Start difference. First operand 8161 states and 10908 transitions. Second operand has 39 states, 39 states have (on average 4.153846153846154) internal successors, (162), 39 states have internal predecessors, (162), 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:43:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:43:47,035 INFO L93 Difference]: Finished difference Result 11105 states and 14480 transitions. [2025-01-09 05:43:47,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-01-09 05:43:47,038 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.153846153846154) internal successors, (162), 39 states have internal predecessors, (162), 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 64 [2025-01-09 05:43:47,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:43:47,046 INFO L225 Difference]: With dead ends: 11105 [2025-01-09 05:43:47,046 INFO L226 Difference]: Without dead ends: 7419 [2025-01-09 05:43:47,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2334 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2170, Invalid=8336, Unknown=0, NotChecked=0, Total=10506 [2025-01-09 05:43:47,051 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 16753 mSDsluCounter, 22667 mSDsCounter, 0 mSdLazyCounter, 2078 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16753 SdHoareTripleChecker+Valid, 24226 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:43:47,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16753 Valid, 24226 Invalid, 2141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2078 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:43:47,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7419 states. [2025-01-09 05:43:47,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7419 to 6543. [2025-01-09 05:43:47,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6543 states, 6541 states have (on average 1.3626356826173367) internal successors, (8913), 6542 states have internal predecessors, (8913), 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:43:47,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6543 states to 6543 states and 8913 transitions. [2025-01-09 05:43:47,248 INFO L78 Accepts]: Start accepts. Automaton has 6543 states and 8913 transitions. Word has length 64 [2025-01-09 05:43:47,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:43:47,249 INFO L471 AbstractCegarLoop]: Abstraction has 6543 states and 8913 transitions. [2025-01-09 05:43:47,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.153846153846154) internal successors, (162), 39 states have internal predecessors, (162), 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:43:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 6543 states and 8913 transitions. [2025-01-09 05:43:47,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:43:47,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:43:47,250 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, 1, 1, 1] [2025-01-09 05:43:47,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 05:43:47,455 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:43:47,455 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:43:47,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:43:47,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1083522640, now seen corresponding path program 1 times [2025-01-09 05:43:47,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:43:47,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416383510] [2025-01-09 05:43:47,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:47,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:43:47,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:43:47,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:43:47,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:47,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:47,910 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:43:47,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:43:47,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416383510] [2025-01-09 05:43:47,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416383510] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:43:47,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309884704] [2025-01-09 05:43:47,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:43:47,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:43:47,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:43:47,913 INFO L229 MonitoredProcess]: Starting monitored process 8 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:43:47,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 05:43:47,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:43:48,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:43:48,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:43:48,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:43:48,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 05:43:48,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:43:51,341 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:43:51,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:43:52,366 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:43:52,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309884704] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:43:52,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:43:52,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 16] total 41 [2025-01-09 05:43:52,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758667109] [2025-01-09 05:43:52,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:43:52,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-09 05:43:52,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:43:52,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-09 05:43:52,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1424, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 05:43:52,368 INFO L87 Difference]: Start difference. First operand 6543 states and 8913 transitions. Second operand has 41 states, 41 states have (on average 4.170731707317073) internal successors, (171), 41 states have internal predecessors, (171), 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:01,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:01,732 INFO L93 Difference]: Finished difference Result 12907 states and 16807 transitions. [2025-01-09 05:44:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-01-09 05:44:01,733 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.170731707317073) internal successors, (171), 41 states have internal predecessors, (171), 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 65 [2025-01-09 05:44:01,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:01,743 INFO L225 Difference]: With dead ends: 12907 [2025-01-09 05:44:01,743 INFO L226 Difference]: Without dead ends: 10337 [2025-01-09 05:44:01,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=2783, Invalid=11023, Unknown=0, NotChecked=0, Total=13806 [2025-01-09 05:44:01,749 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 16539 mSDsluCounter, 19062 mSDsCounter, 0 mSdLazyCounter, 1929 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16539 SdHoareTripleChecker+Valid, 20590 SdHoareTripleChecker+Invalid, 1986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:01,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16539 Valid, 20590 Invalid, 1986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1929 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 05:44:01,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10337 states. [2025-01-09 05:44:02,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10337 to 7421. [2025-01-09 05:44:02,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7421 states, 7419 states have (on average 1.3553039493193153) internal successors, (10055), 7420 states have internal predecessors, (10055), 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:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7421 states to 7421 states and 10055 transitions. [2025-01-09 05:44:02,022 INFO L78 Accepts]: Start accepts. Automaton has 7421 states and 10055 transitions. Word has length 65 [2025-01-09 05:44:02,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:02,022 INFO L471 AbstractCegarLoop]: Abstraction has 7421 states and 10055 transitions. [2025-01-09 05:44:02,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.170731707317073) internal successors, (171), 41 states have internal predecessors, (171), 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:02,022 INFO L276 IsEmpty]: Start isEmpty. Operand 7421 states and 10055 transitions. [2025-01-09 05:44:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 05:44:02,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:02,024 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, 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:44:02,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 05:44:02,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:44:02,224 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:02,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:02,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2124698795, now seen corresponding path program 1 times [2025-01-09 05:44:02,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:02,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650911197] [2025-01-09 05:44:02,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:02,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:02,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:44:02,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:44:02,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:02,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:02,737 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 32 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:02,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:02,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650911197] [2025-01-09 05:44:02,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650911197] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:44:02,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423388038] [2025-01-09 05:44:02,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:02,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:44:02,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:44:02,740 INFO L229 MonitoredProcess]: Starting monitored process 9 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:02,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 05:44:02,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:44:02,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:44:02,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:02,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:02,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 05:44:02,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:44:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 34 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:03,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:44:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 32 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:04,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423388038] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:44:04,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:44:04,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2025-01-09 05:44:04,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43733952] [2025-01-09 05:44:04,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:44:04,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 05:44:04,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:04,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 05:44:04,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2025-01-09 05:44:04,342 INFO L87 Difference]: Start difference. First operand 7421 states and 10055 transitions. Second operand has 30 states, 30 states have (on average 8.4) internal successors, (252), 29 states have internal predecessors, (252), 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:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:05,102 INFO L93 Difference]: Finished difference Result 10965 states and 14472 transitions. [2025-01-09 05:44:05,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 05:44:05,102 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.4) internal successors, (252), 29 states have internal predecessors, (252), 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 105 [2025-01-09 05:44:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:05,110 INFO L225 Difference]: With dead ends: 10965 [2025-01-09 05:44:05,110 INFO L226 Difference]: Without dead ends: 7645 [2025-01-09 05:44:05,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=449, Invalid=1531, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 05:44:05,114 INFO L435 NwaCegarLoop]: 1516 mSDtfsCounter, 10417 mSDsluCounter, 9256 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10417 SdHoareTripleChecker+Valid, 10772 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:05,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10417 Valid, 10772 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:44:05,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7645 states. [2025-01-09 05:44:05,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7645 to 7421. [2025-01-09 05:44:05,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7421 states, 7419 states have (on average 1.3468122388462056) internal successors, (9992), 7420 states have internal predecessors, (9992), 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:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7421 states to 7421 states and 9992 transitions. [2025-01-09 05:44:05,357 INFO L78 Accepts]: Start accepts. Automaton has 7421 states and 9992 transitions. Word has length 105 [2025-01-09 05:44:05,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:05,357 INFO L471 AbstractCegarLoop]: Abstraction has 7421 states and 9992 transitions. [2025-01-09 05:44:05,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.4) internal successors, (252), 29 states have internal predecessors, (252), 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:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 7421 states and 9992 transitions. [2025-01-09 05:44:05,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 05:44:05,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:05,359 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, 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] [2025-01-09 05:44:05,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 05:44:05,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:44:05,560 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:05,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:05,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1833697707, now seen corresponding path program 1 times [2025-01-09 05:44:05,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:05,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445472039] [2025-01-09 05:44:05,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:05,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:05,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:44:05,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:44:05,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:05,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:05,975 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 22 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:05,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:05,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445472039] [2025-01-09 05:44:05,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445472039] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:44:05,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895084210] [2025-01-09 05:44:05,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:05,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:44:05,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:44:05,980 INFO L229 MonitoredProcess]: Starting monitored process 10 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:05,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 05:44:06,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:44:06,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:44:06,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:06,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:06,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 05:44:06,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:44:06,529 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 24 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:06,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:44:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 22 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:07,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895084210] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:44:07,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:44:07,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2025-01-09 05:44:07,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891464649] [2025-01-09 05:44:07,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:44:07,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 05:44:07,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:07,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 05:44:07,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2025-01-09 05:44:07,706 INFO L87 Difference]: Start difference. First operand 7421 states and 9992 transitions. Second operand has 27 states, 27 states have (on average 8.666666666666666) internal successors, (234), 26 states have internal predecessors, (234), 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:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:08,345 INFO L93 Difference]: Finished difference Result 11647 states and 15185 transitions. [2025-01-09 05:44:08,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 05:44:08,345 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.666666666666666) internal successors, (234), 26 states have internal predecessors, (234), 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 105 [2025-01-09 05:44:08,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:08,353 INFO L225 Difference]: With dead ends: 11647 [2025-01-09 05:44:08,353 INFO L226 Difference]: Without dead ends: 7499 [2025-01-09 05:44:08,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=373, Invalid=1349, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 05:44:08,358 INFO L435 NwaCegarLoop]: 1517 mSDtfsCounter, 11879 mSDsluCounter, 12142 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11879 SdHoareTripleChecker+Valid, 13659 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:08,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11879 Valid, 13659 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:44:08,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7499 states. [2025-01-09 05:44:08,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7499 to 7373. [2025-01-09 05:44:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7373 states, 7371 states have (on average 1.33672500339167) internal successors, (9853), 7372 states have internal predecessors, (9853), 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:08,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7373 states to 7373 states and 9853 transitions. [2025-01-09 05:44:08,584 INFO L78 Accepts]: Start accepts. Automaton has 7373 states and 9853 transitions. Word has length 105 [2025-01-09 05:44:08,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:08,585 INFO L471 AbstractCegarLoop]: Abstraction has 7373 states and 9853 transitions. [2025-01-09 05:44:08,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.666666666666666) internal successors, (234), 26 states have internal predecessors, (234), 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:08,585 INFO L276 IsEmpty]: Start isEmpty. Operand 7373 states and 9853 transitions. [2025-01-09 05:44:08,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 05:44:08,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:08,586 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, 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:44:08,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 05:44:08,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:44:08,791 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:08,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:08,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1482130915, now seen corresponding path program 1 times [2025-01-09 05:44:08,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:08,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450475776] [2025-01-09 05:44:08,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:08,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:08,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:44:08,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:44:08,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:08,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 26 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:09,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:09,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450475776] [2025-01-09 05:44:09,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450475776] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:44:09,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933504643] [2025-01-09 05:44:09,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:09,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:44:09,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:44:09,370 INFO L229 MonitoredProcess]: Starting monitored process 11 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:09,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 05:44:09,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:44:09,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:44:09,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:09,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:09,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-09 05:44:09,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:44:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 16 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:10,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:44:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 16 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:44:13,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933504643] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:44:13,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:44:13,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 21] total 61 [2025-01-09 05:44:13,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011165544] [2025-01-09 05:44:13,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:44:13,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-01-09 05:44:13,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:13,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-01-09 05:44:13,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=3303, Unknown=0, NotChecked=0, Total=3660 [2025-01-09 05:44:13,121 INFO L87 Difference]: Start difference. First operand 7373 states and 9853 transitions. Second operand has 61 states, 61 states have (on average 4.934426229508197) internal successors, (301), 61 states have internal predecessors, (301), 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)