./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/mem_slave_tlm.4.cil.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/systemc/mem_slave_tlm.4.cil.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 69030034dd333d91bcd0f7615fd4a158a32a8c2c03a6334daabdaad4c77a89b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:15:36,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:15:36,438 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:15:36,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:15:36,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:15:36,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:15:36,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:15:36,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:15:36,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:15:36,466 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:15:36,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:15:36,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:15:36,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:15:36,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:15:36,467 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:15:36,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:15:36,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:15:36,467 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:15:36,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:15:36,467 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:15:36,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:15:36,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:15:36,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:15:36,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:15:36,468 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:15:36,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:15:36,468 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:15:36,468 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:15:36,468 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:15:36,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:15:36,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:15:36,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:15:36,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:15:36,468 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:15:36,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:15:36,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:15:36,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:15:36,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:15:36,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:15:36,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:15:36,469 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:15:36,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:15:36,469 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:15:36,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:15:36,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:15:36,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:15:36,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:15:36,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:15:36,469 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 -> 69030034dd333d91bcd0f7615fd4a158a32a8c2c03a6334daabdaad4c77a89b5 [2025-01-09 04:15:36,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:15:36,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:15:36,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:15:36,741 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:15:36,741 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:15:36,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/mem_slave_tlm.4.cil.c [2025-01-09 04:15:37,989 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/619b5e5c0/371d135f596b413c97f1bbf56c67a023/FLAGf05425caa [2025-01-09 04:15:38,277 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:15:38,281 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.4.cil.c [2025-01-09 04:15:38,293 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/619b5e5c0/371d135f596b413c97f1bbf56c67a023/FLAGf05425caa [2025-01-09 04:15:38,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/619b5e5c0/371d135f596b413c97f1bbf56c67a023 [2025-01-09 04:15:38,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:15:38,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:15:38,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:15:38,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:15:38,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:15:38,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:15:38" (1/1) ... [2025-01-09 04:15:38,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c9141d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:38, skipping insertion in model container [2025-01-09 04:15:38,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:15:38" (1/1) ... [2025-01-09 04:15:38,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:15:38,443 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/systemc/mem_slave_tlm.4.cil.c[646,659] [2025-01-09 04:15:38,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:15:38,555 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:15:38,563 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/systemc/mem_slave_tlm.4.cil.c[646,659] [2025-01-09 04:15:38,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:15:38,630 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:15:38,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:38 WrapperNode [2025-01-09 04:15:38,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:15:38,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:15:38,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:15:38,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:15:38,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:38" (1/1) ... [2025-01-09 04:15:38,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:38" (1/1) ... [2025-01-09 04:15:38,675 INFO L138 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 823 [2025-01-09 04:15:38,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:15:38,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:15:38,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:15:38,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:15:38,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:38" (1/1) ... [2025-01-09 04:15:38,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:38" (1/1) ... [2025-01-09 04:15:38,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:38" (1/1) ... [2025-01-09 04:15:38,721 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 04:15:38,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:38" (1/1) ... [2025-01-09 04:15:38,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:38" (1/1) ... [2025-01-09 04:15:38,727 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:38" (1/1) ... [2025-01-09 04:15:38,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:38" (1/1) ... [2025-01-09 04:15:38,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:38" (1/1) ... [2025-01-09 04:15:38,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:38" (1/1) ... [2025-01-09 04:15:38,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:38" (1/1) ... [2025-01-09 04:15:38,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:15:38,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:15:38,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:15:38,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:15:38,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:38" (1/1) ... [2025-01-09 04:15:38,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:15:38,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:38,767 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 04:15:38,769 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 04:15:38,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:15:38,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:15:38,786 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 04:15:38,786 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 04:15:38,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:15:38,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:15:38,849 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:15:38,851 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:15:39,454 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2025-01-09 04:15:39,454 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:15:39,477 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:15:39,477 INFO L312 CfgBuilder]: Removed 13 assume(true) statements. [2025-01-09 04:15:39,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:15:39 BoogieIcfgContainer [2025-01-09 04:15:39,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:15:39,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:15:39,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:15:39,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:15:39,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:15:38" (1/3) ... [2025-01-09 04:15:39,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd1cc2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:15:39, skipping insertion in model container [2025-01-09 04:15:39,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:38" (2/3) ... [2025-01-09 04:15:39,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd1cc2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:15:39, skipping insertion in model container [2025-01-09 04:15:39,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:15:39" (3/3) ... [2025-01-09 04:15:39,492 INFO L128 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.4.cil.c [2025-01-09 04:15:39,502 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:15:39,504 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mem_slave_tlm.4.cil.c that has 2 procedures, 265 locations, 1 initial locations, 13 loop locations, and 1 error locations. [2025-01-09 04:15:39,550 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:15:39,560 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;@595de8b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:15:39,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:15:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 265 states, 257 states have (on average 1.8443579766536966) internal successors, (474), 263 states have internal predecessors, (474), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 04:15:39,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 04:15:39,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:39,574 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] [2025-01-09 04:15:39,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:39,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:39,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1102775605, now seen corresponding path program 1 times [2025-01-09 04:15:39,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:39,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295136943] [2025-01-09 04:15:39,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:39,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:39,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 04:15:39,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 04:15:39,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:39,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:39,830 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 04:15:39,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:39,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295136943] [2025-01-09 04:15:39,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295136943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:39,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:39,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:39,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336976617] [2025-01-09 04:15:39,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:39,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:39,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:39,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:39,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:39,850 INFO L87 Difference]: Start difference. First operand has 265 states, 257 states have (on average 1.8443579766536966) internal successors, (474), 263 states have internal predecessors, (474), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:40,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:40,120 INFO L93 Difference]: Finished difference Result 694 states and 1266 transitions. [2025-01-09 04:15:40,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:40,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-01-09 04:15:40,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:40,128 INFO L225 Difference]: With dead ends: 694 [2025-01-09 04:15:40,128 INFO L226 Difference]: Without dead ends: 426 [2025-01-09 04:15:40,130 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 04:15:40,132 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 255 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:40,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 763 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:15:40,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-01-09 04:15:40,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 413. [2025-01-09 04:15:40,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 407 states have (on average 1.6363636363636365) internal successors, (666), 411 states have internal predecessors, (666), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:40,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 671 transitions. [2025-01-09 04:15:40,180 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 671 transitions. Word has length 27 [2025-01-09 04:15:40,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:40,180 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 671 transitions. [2025-01-09 04:15:40,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:40,181 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 671 transitions. [2025-01-09 04:15:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 04:15:40,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:40,182 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 04:15:40,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:15:40,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:40,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:40,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2102877181, now seen corresponding path program 1 times [2025-01-09 04:15:40,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:40,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324029973] [2025-01-09 04:15:40,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:40,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:40,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 04:15:40,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 04:15:40,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:40,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:40,225 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 04:15:40,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:40,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324029973] [2025-01-09 04:15:40,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324029973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:40,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:40,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:40,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823406679] [2025-01-09 04:15:40,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:40,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:40,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:40,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:40,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:40,227 INFO L87 Difference]: Start difference. First operand 413 states and 671 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:40,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:40,315 INFO L93 Difference]: Finished difference Result 1085 states and 1789 transitions. [2025-01-09 04:15:40,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:40,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 04:15:40,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:40,319 INFO L225 Difference]: With dead ends: 1085 [2025-01-09 04:15:40,319 INFO L226 Difference]: Without dead ends: 686 [2025-01-09 04:15:40,320 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 04:15:40,321 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 320 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:40,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1000 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:15:40,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-01-09 04:15:40,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 673. [2025-01-09 04:15:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 667 states have (on average 1.6731634182908546) internal successors, (1116), 671 states have internal predecessors, (1116), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:40,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1121 transitions. [2025-01-09 04:15:40,342 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1121 transitions. Word has length 37 [2025-01-09 04:15:40,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:40,343 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 1121 transitions. [2025-01-09 04:15:40,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:40,343 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1121 transitions. [2025-01-09 04:15:40,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 04:15:40,345 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:40,345 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 04:15:40,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:15:40,345 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:40,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:40,346 INFO L85 PathProgramCache]: Analyzing trace with hash -283140, now seen corresponding path program 1 times [2025-01-09 04:15:40,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:40,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597823456] [2025-01-09 04:15:40,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:40,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:40,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 04:15:40,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 04:15:40,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:40,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:40,388 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 04:15:40,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:40,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597823456] [2025-01-09 04:15:40,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597823456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:40,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:40,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:40,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846525814] [2025-01-09 04:15:40,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:40,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:40,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:40,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:40,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:40,389 INFO L87 Difference]: Start difference. First operand 673 states and 1121 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:40,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:40,440 INFO L93 Difference]: Finished difference Result 1677 states and 2800 transitions. [2025-01-09 04:15:40,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:40,441 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 04:15:40,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:40,444 INFO L225 Difference]: With dead ends: 1677 [2025-01-09 04:15:40,445 INFO L226 Difference]: Without dead ends: 1029 [2025-01-09 04:15:40,445 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 04:15:40,446 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 348 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:40,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 793 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:40,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-01-09 04:15:40,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1018. [2025-01-09 04:15:40,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1012 states have (on average 1.6699604743083003) internal successors, (1690), 1016 states have internal predecessors, (1690), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1695 transitions. [2025-01-09 04:15:40,470 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1695 transitions. Word has length 38 [2025-01-09 04:15:40,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:40,471 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1695 transitions. [2025-01-09 04:15:40,471 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:40,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1695 transitions. [2025-01-09 04:15:40,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 04:15:40,472 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:40,472 INFO L218 NwaCegarLoop]: trace histogram [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 04:15:40,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:15:40,473 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:40,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:40,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1511225179, now seen corresponding path program 1 times [2025-01-09 04:15:40,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:40,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344563077] [2025-01-09 04:15:40,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:40,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:40,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 04:15:40,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 04:15:40,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:40,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:40,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:40,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:40,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344563077] [2025-01-09 04:15:40,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344563077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:40,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:40,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:15:40,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763930599] [2025-01-09 04:15:40,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:40,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:15:40,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:40,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:15:40,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:15:40,540 INFO L87 Difference]: Start difference. First operand 1018 states and 1695 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:40,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:40,816 INFO L93 Difference]: Finished difference Result 2796 states and 4641 transitions. [2025-01-09 04:15:40,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:15:40,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-01-09 04:15:40,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:40,823 INFO L225 Difference]: With dead ends: 2796 [2025-01-09 04:15:40,823 INFO L226 Difference]: Without dead ends: 1803 [2025-01-09 04:15:40,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:15:40,825 INFO L435 NwaCegarLoop]: 686 mSDtfsCounter, 568 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:40,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1534 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:15:40,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2025-01-09 04:15:40,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1582. [2025-01-09 04:15:40,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1576 states have (on average 1.649746192893401) internal successors, (2600), 1580 states have internal predecessors, (2600), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:40,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2605 transitions. [2025-01-09 04:15:40,860 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2605 transitions. Word has length 42 [2025-01-09 04:15:40,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:40,860 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2605 transitions. [2025-01-09 04:15:40,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2605 transitions. [2025-01-09 04:15:40,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 04:15:40,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:40,861 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] [2025-01-09 04:15:40,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:15:40,862 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:40,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:40,862 INFO L85 PathProgramCache]: Analyzing trace with hash 985208937, now seen corresponding path program 1 times [2025-01-09 04:15:40,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:40,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35958421] [2025-01-09 04:15:40,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:40,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:40,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 04:15:40,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 04:15:40,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:40,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:40,947 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 04:15:40,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:40,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35958421] [2025-01-09 04:15:40,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35958421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:40,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:40,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:15:40,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562245657] [2025-01-09 04:15:40,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:40,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:15:40,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:40,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:15:40,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:15:40,949 INFO L87 Difference]: Start difference. First operand 1582 states and 2605 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:41,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:41,277 INFO L93 Difference]: Finished difference Result 4677 states and 7624 transitions. [2025-01-09 04:15:41,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:15:41,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-01-09 04:15:41,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:41,287 INFO L225 Difference]: With dead ends: 4677 [2025-01-09 04:15:41,288 INFO L226 Difference]: Without dead ends: 3114 [2025-01-09 04:15:41,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:15:41,291 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 724 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:41,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1031 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:15:41,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2025-01-09 04:15:41,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 2774. [2025-01-09 04:15:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2774 states, 2768 states have (on average 1.6253612716763006) internal successors, (4499), 2772 states have internal predecessors, (4499), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:41,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 4504 transitions. [2025-01-09 04:15:41,359 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 4504 transitions. Word has length 47 [2025-01-09 04:15:41,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:41,359 INFO L471 AbstractCegarLoop]: Abstraction has 2774 states and 4504 transitions. [2025-01-09 04:15:41,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:41,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 4504 transitions. [2025-01-09 04:15:41,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 04:15:41,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:41,376 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] [2025-01-09 04:15:41,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:15:41,376 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:41,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:41,377 INFO L85 PathProgramCache]: Analyzing trace with hash -917628727, now seen corresponding path program 1 times [2025-01-09 04:15:41,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:41,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590537689] [2025-01-09 04:15:41,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:41,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:41,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 04:15:41,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 04:15:41,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:41,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:41,430 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 04:15:41,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:41,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590537689] [2025-01-09 04:15:41,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590537689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:41,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:41,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:41,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939795402] [2025-01-09 04:15:41,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:41,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:41,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:41,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:41,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:41,435 INFO L87 Difference]: Start difference. First operand 2774 states and 4504 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:41,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:41,517 INFO L93 Difference]: Finished difference Result 6481 states and 10509 transitions. [2025-01-09 04:15:41,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:41,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-01-09 04:15:41,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:41,530 INFO L225 Difference]: With dead ends: 6481 [2025-01-09 04:15:41,530 INFO L226 Difference]: Without dead ends: 3730 [2025-01-09 04:15:41,534 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 04:15:41,535 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 366 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:41,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 696 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:41,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3730 states. [2025-01-09 04:15:41,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3730 to 3574. [2025-01-09 04:15:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3574 states, 3568 states have (on average 1.6090246636771302) internal successors, (5741), 3572 states have internal predecessors, (5741), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 5746 transitions. [2025-01-09 04:15:41,661 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 5746 transitions. Word has length 47 [2025-01-09 04:15:41,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:41,662 INFO L471 AbstractCegarLoop]: Abstraction has 3574 states and 5746 transitions. [2025-01-09 04:15:41,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:41,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 5746 transitions. [2025-01-09 04:15:41,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 04:15:41,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:41,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:41,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:15:41,664 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:41,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:41,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1535305176, now seen corresponding path program 1 times [2025-01-09 04:15:41,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:41,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107337040] [2025-01-09 04:15:41,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:41,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:41,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 04:15:41,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 04:15:41,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:41,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:41,738 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 04:15:41,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:41,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107337040] [2025-01-09 04:15:41,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107337040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:41,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:41,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:41,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293408991] [2025-01-09 04:15:41,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:41,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:41,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:41,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:41,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:41,739 INFO L87 Difference]: Start difference. First operand 3574 states and 5746 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:42,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:42,017 INFO L93 Difference]: Finished difference Result 8600 states and 13946 transitions. [2025-01-09 04:15:42,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:42,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 04:15:42,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:42,035 INFO L225 Difference]: With dead ends: 8600 [2025-01-09 04:15:42,035 INFO L226 Difference]: Without dead ends: 5049 [2025-01-09 04:15:42,041 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 04:15:42,042 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 243 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:42,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 853 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:15:42,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5049 states. [2025-01-09 04:15:42,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5049 to 4336. [2025-01-09 04:15:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4336 states, 4330 states have (on average 1.5468822170900693) internal successors, (6698), 4334 states have internal predecessors, (6698), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4336 states to 4336 states and 6703 transitions. [2025-01-09 04:15:42,203 INFO L78 Accepts]: Start accepts. Automaton has 4336 states and 6703 transitions. Word has length 54 [2025-01-09 04:15:42,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:42,204 INFO L471 AbstractCegarLoop]: Abstraction has 4336 states and 6703 transitions. [2025-01-09 04:15:42,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:42,204 INFO L276 IsEmpty]: Start isEmpty. Operand 4336 states and 6703 transitions. [2025-01-09 04:15:42,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:15:42,209 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:42,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:42,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:15:42,209 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:42,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:42,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1053418260, now seen corresponding path program 1 times [2025-01-09 04:15:42,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:42,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998354800] [2025-01-09 04:15:42,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:42,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:42,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:15:42,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:15:42,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:42,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:42,299 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 04:15:42,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:42,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998354800] [2025-01-09 04:15:42,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998354800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:42,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:42,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:42,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476047927] [2025-01-09 04:15:42,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:42,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:42,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:42,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:42,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:42,300 INFO L87 Difference]: Start difference. First operand 4336 states and 6703 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:42,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:42,497 INFO L93 Difference]: Finished difference Result 8523 states and 13191 transitions. [2025-01-09 04:15:42,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:42,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 04:15:42,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:42,512 INFO L225 Difference]: With dead ends: 8523 [2025-01-09 04:15:42,512 INFO L226 Difference]: Without dead ends: 4210 [2025-01-09 04:15:42,516 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 04:15:42,517 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 344 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:42,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 435 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:15:42,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4210 states. [2025-01-09 04:15:42,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4210 to 4210. [2025-01-09 04:15:42,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4210 states, 4204 states have (on average 1.5235490009514747) internal successors, (6405), 4208 states have internal predecessors, (6405), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 6410 transitions. [2025-01-09 04:15:42,619 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 6410 transitions. Word has length 56 [2025-01-09 04:15:42,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:42,619 INFO L471 AbstractCegarLoop]: Abstraction has 4210 states and 6410 transitions. [2025-01-09 04:15:42,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:42,620 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 6410 transitions. [2025-01-09 04:15:42,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:15:42,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:42,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:42,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:15:42,622 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:42,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:42,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1087849823, now seen corresponding path program 1 times [2025-01-09 04:15:42,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:42,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144541697] [2025-01-09 04:15:42,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:42,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:42,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:15:42,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:15:42,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:42,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:42,660 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 04:15:42,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:42,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144541697] [2025-01-09 04:15:42,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144541697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:42,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:42,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:42,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102644139] [2025-01-09 04:15:42,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:42,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:42,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:42,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:42,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:42,661 INFO L87 Difference]: Start difference. First operand 4210 states and 6410 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:42,831 INFO L93 Difference]: Finished difference Result 8002 states and 12283 transitions. [2025-01-09 04:15:42,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:42,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 04:15:42,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:42,860 INFO L225 Difference]: With dead ends: 8002 [2025-01-09 04:15:42,867 INFO L226 Difference]: Without dead ends: 3815 [2025-01-09 04:15:42,871 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 04:15:42,879 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 145 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:42,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 878 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:15:42,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3815 states. [2025-01-09 04:15:43,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3815 to 3226. [2025-01-09 04:15:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3226 states, 3220 states have (on average 1.5419254658385093) internal successors, (4965), 3224 states have internal predecessors, (4965), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:43,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 3226 states and 4970 transitions. [2025-01-09 04:15:43,062 INFO L78 Accepts]: Start accepts. Automaton has 3226 states and 4970 transitions. Word has length 56 [2025-01-09 04:15:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:43,063 INFO L471 AbstractCegarLoop]: Abstraction has 3226 states and 4970 transitions. [2025-01-09 04:15:43,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:43,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3226 states and 4970 transitions. [2025-01-09 04:15:43,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 04:15:43,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:43,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:43,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:15:43,068 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:43,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:43,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1054059171, now seen corresponding path program 1 times [2025-01-09 04:15:43,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:43,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899296589] [2025-01-09 04:15:43,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:43,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:43,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 04:15:43,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 04:15:43,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:43,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:43,225 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 04:15:43,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:43,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899296589] [2025-01-09 04:15:43,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899296589] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:43,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:43,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:15:43,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942750927] [2025-01-09 04:15:43,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:43,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:15:43,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:43,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:15:43,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:43,227 INFO L87 Difference]: Start difference. First operand 3226 states and 4970 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:43,800 INFO L93 Difference]: Finished difference Result 8751 states and 13420 transitions. [2025-01-09 04:15:43,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:15:43,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 04:15:43,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:43,817 INFO L225 Difference]: With dead ends: 8751 [2025-01-09 04:15:43,817 INFO L226 Difference]: Without dead ends: 5726 [2025-01-09 04:15:43,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:15:43,824 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 918 mSDsluCounter, 1807 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 2347 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:43,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 2347 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:15:43,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5726 states. [2025-01-09 04:15:43,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5726 to 3996. [2025-01-09 04:15:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3996 states, 3990 states have (on average 1.5355889724310776) internal successors, (6127), 3994 states have internal predecessors, (6127), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:43,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3996 states to 3996 states and 6132 transitions. [2025-01-09 04:15:43,996 INFO L78 Accepts]: Start accepts. Automaton has 3996 states and 6132 transitions. Word has length 59 [2025-01-09 04:15:43,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:43,998 INFO L471 AbstractCegarLoop]: Abstraction has 3996 states and 6132 transitions. [2025-01-09 04:15:43,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:43,998 INFO L276 IsEmpty]: Start isEmpty. Operand 3996 states and 6132 transitions. [2025-01-09 04:15:43,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 04:15:43,999 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:43,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:44,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:15:44,000 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:44,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:44,000 INFO L85 PathProgramCache]: Analyzing trace with hash -420597278, now seen corresponding path program 1 times [2025-01-09 04:15:44,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:44,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177316439] [2025-01-09 04:15:44,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:44,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:44,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 04:15:44,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 04:15:44,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:44,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:44,128 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 04:15:44,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:44,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177316439] [2025-01-09 04:15:44,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177316439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:44,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:44,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:15:44,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157481205] [2025-01-09 04:15:44,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:44,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:15:44,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:44,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:15:44,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:15:44,130 INFO L87 Difference]: Start difference. First operand 3996 states and 6132 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:44,425 INFO L93 Difference]: Finished difference Result 9571 states and 14572 transitions. [2025-01-09 04:15:44,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:15:44,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-01-09 04:15:44,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:44,443 INFO L225 Difference]: With dead ends: 9571 [2025-01-09 04:15:44,444 INFO L226 Difference]: Without dead ends: 5776 [2025-01-09 04:15:44,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:15:44,452 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 798 mSDsluCounter, 2350 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 2881 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:44,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 2881 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:15:44,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5776 states. [2025-01-09 04:15:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5776 to 4280. [2025-01-09 04:15:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4280 states, 4274 states have (on average 1.5238652316331305) internal successors, (6513), 4278 states have internal predecessors, (6513), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:44,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 6518 transitions. [2025-01-09 04:15:44,603 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 6518 transitions. Word has length 60 [2025-01-09 04:15:44,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:44,603 INFO L471 AbstractCegarLoop]: Abstraction has 4280 states and 6518 transitions. [2025-01-09 04:15:44,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:44,603 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 6518 transitions. [2025-01-09 04:15:44,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:15:44,605 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:44,605 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:44,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:15:44,605 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:44,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:44,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1998437039, now seen corresponding path program 1 times [2025-01-09 04:15:44,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:44,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151407082] [2025-01-09 04:15:44,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:44,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:44,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:15:44,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:15:44,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:44,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:44,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:44,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:44,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151407082] [2025-01-09 04:15:44,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151407082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:44,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:44,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:44,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279773169] [2025-01-09 04:15:44,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:44,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:44,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:44,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:44,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:44,633 INFO L87 Difference]: Start difference. First operand 4280 states and 6518 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:44,754 INFO L93 Difference]: Finished difference Result 9025 states and 13718 transitions. [2025-01-09 04:15:44,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:44,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-01-09 04:15:44,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:44,765 INFO L225 Difference]: With dead ends: 9025 [2025-01-09 04:15:44,765 INFO L226 Difference]: Without dead ends: 4766 [2025-01-09 04:15:44,772 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 04:15:44,772 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 133 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:44,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 801 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:44,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4766 states. [2025-01-09 04:15:44,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4766 to 4708. [2025-01-09 04:15:44,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4708 states, 4702 states have (on average 1.5178647384091877) internal successors, (7137), 4706 states have internal predecessors, (7137), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:44,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4708 states to 4708 states and 7142 transitions. [2025-01-09 04:15:44,926 INFO L78 Accepts]: Start accepts. Automaton has 4708 states and 7142 transitions. Word has length 70 [2025-01-09 04:15:44,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:44,927 INFO L471 AbstractCegarLoop]: Abstraction has 4708 states and 7142 transitions. [2025-01-09 04:15:44,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:44,927 INFO L276 IsEmpty]: Start isEmpty. Operand 4708 states and 7142 transitions. [2025-01-09 04:15:44,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 04:15:44,929 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:44,929 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:44,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:15:44,930 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:44,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:44,930 INFO L85 PathProgramCache]: Analyzing trace with hash 758804763, now seen corresponding path program 1 times [2025-01-09 04:15:44,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:44,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559955787] [2025-01-09 04:15:44,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:44,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:44,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 04:15:44,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 04:15:44,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:44,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:44,994 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:44,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:44,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559955787] [2025-01-09 04:15:44,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559955787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:44,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:44,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:15:44,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379147790] [2025-01-09 04:15:44,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:44,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:15:44,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:44,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:15:44,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:15:44,995 INFO L87 Difference]: Start difference. First operand 4708 states and 7142 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:45,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:45,381 INFO L93 Difference]: Finished difference Result 12517 states and 18867 transitions. [2025-01-09 04:15:45,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:15:45,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-01-09 04:15:45,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:45,400 INFO L225 Difference]: With dead ends: 12517 [2025-01-09 04:15:45,401 INFO L226 Difference]: Without dead ends: 7720 [2025-01-09 04:15:45,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:15:45,410 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 623 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:45,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1372 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:15:45,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7720 states. [2025-01-09 04:15:45,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7720 to 6837. [2025-01-09 04:15:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6837 states, 6831 states have (on average 1.49187527448397) internal successors, (10191), 6835 states have internal predecessors, (10191), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:45,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6837 states to 6837 states and 10196 transitions. [2025-01-09 04:15:45,622 INFO L78 Accepts]: Start accepts. Automaton has 6837 states and 10196 transitions. Word has length 80 [2025-01-09 04:15:45,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:45,623 INFO L471 AbstractCegarLoop]: Abstraction has 6837 states and 10196 transitions. [2025-01-09 04:15:45,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:45,624 INFO L276 IsEmpty]: Start isEmpty. Operand 6837 states and 10196 transitions. [2025-01-09 04:15:45,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:15:45,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:45,626 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:45,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:15:45,626 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:45,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:45,626 INFO L85 PathProgramCache]: Analyzing trace with hash 11059977, now seen corresponding path program 1 times [2025-01-09 04:15:45,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:45,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359114853] [2025-01-09 04:15:45,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:45,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:45,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:15:45,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:15:45,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:45,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:45,672 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:45,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:45,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359114853] [2025-01-09 04:15:45,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359114853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:45,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:45,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:45,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315884806] [2025-01-09 04:15:45,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:45,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:45,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:45,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:45,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:45,673 INFO L87 Difference]: Start difference. First operand 6837 states and 10196 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:45,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:45,780 INFO L93 Difference]: Finished difference Result 9836 states and 14709 transitions. [2025-01-09 04:15:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:45,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-01-09 04:15:45,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:45,788 INFO L225 Difference]: With dead ends: 9836 [2025-01-09 04:15:45,788 INFO L226 Difference]: Without dead ends: 3003 [2025-01-09 04:15:45,795 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 04:15:45,796 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 336 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:45,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 497 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:45,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2025-01-09 04:15:45,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 2958. [2025-01-09 04:15:45,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2958 states, 2952 states have (on average 1.3943089430894309) internal successors, (4116), 2956 states have internal predecessors, (4116), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 4121 transitions. [2025-01-09 04:15:45,911 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 4121 transitions. Word has length 87 [2025-01-09 04:15:45,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:45,911 INFO L471 AbstractCegarLoop]: Abstraction has 2958 states and 4121 transitions. [2025-01-09 04:15:45,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:45,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 4121 transitions. [2025-01-09 04:15:45,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 04:15:45,913 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:45,913 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:45,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:15:45,913 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:45,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:45,914 INFO L85 PathProgramCache]: Analyzing trace with hash 970989314, now seen corresponding path program 1 times [2025-01-09 04:15:45,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:45,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299709197] [2025-01-09 04:15:45,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:45,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:45,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 04:15:45,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 04:15:45,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:45,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:45,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:45,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:45,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299709197] [2025-01-09 04:15:45,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299709197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:45,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:45,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:15:45,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565032799] [2025-01-09 04:15:45,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:45,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:15:45,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:45,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:15:45,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:15:45,983 INFO L87 Difference]: Start difference. First operand 2958 states and 4121 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:46,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:46,169 INFO L93 Difference]: Finished difference Result 6731 states and 9376 transitions. [2025-01-09 04:15:46,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:15:46,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 04:15:46,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:46,179 INFO L225 Difference]: With dead ends: 6731 [2025-01-09 04:15:46,179 INFO L226 Difference]: Without dead ends: 3929 [2025-01-09 04:15:46,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:15:46,184 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 529 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 2310 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:46,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 2310 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:46,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3929 states. [2025-01-09 04:15:46,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3929 to 2960. [2025-01-09 04:15:46,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2960 states, 2954 states have (on average 1.3920108327691265) internal successors, (4112), 2958 states have internal predecessors, (4112), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:46,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2960 states to 2960 states and 4117 transitions. [2025-01-09 04:15:46,303 INFO L78 Accepts]: Start accepts. Automaton has 2960 states and 4117 transitions. Word has length 90 [2025-01-09 04:15:46,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:46,303 INFO L471 AbstractCegarLoop]: Abstraction has 2960 states and 4117 transitions. [2025-01-09 04:15:46,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:46,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2960 states and 4117 transitions. [2025-01-09 04:15:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 04:15:46,305 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:46,305 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:46,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:15:46,305 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:46,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:46,306 INFO L85 PathProgramCache]: Analyzing trace with hash 167231773, now seen corresponding path program 1 times [2025-01-09 04:15:46,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:46,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027101905] [2025-01-09 04:15:46,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:46,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:46,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 04:15:46,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 04:15:46,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:46,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:46,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:46,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027101905] [2025-01-09 04:15:46,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027101905] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:46,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637398254] [2025-01-09 04:15:46,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:46,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:46,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:46,389 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 04:15:46,394 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 04:15:46,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 04:15:46,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 04:15:46,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:46,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:46,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 04:15:46,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:46,590 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:15:46,591 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:15:46,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637398254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:46,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:15:46,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 04:15:46,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334963227] [2025-01-09 04:15:46,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:46,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:46,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:46,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:46,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:46,592 INFO L87 Difference]: Start difference. First operand 2960 states and 4117 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:46,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:46,707 INFO L93 Difference]: Finished difference Result 3571 states and 4946 transitions. [2025-01-09 04:15:46,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:46,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-01-09 04:15:46,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:46,717 INFO L225 Difference]: With dead ends: 3571 [2025-01-09 04:15:46,717 INFO L226 Difference]: Without dead ends: 3567 [2025-01-09 04:15:46,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:46,720 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 231 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:46,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 781 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:46,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3567 states. [2025-01-09 04:15:46,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3567 to 3517. [2025-01-09 04:15:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3517 states, 3511 states have (on average 1.3850754770720592) internal successors, (4863), 3515 states have internal predecessors, (4863), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3517 states to 3517 states and 4868 transitions. [2025-01-09 04:15:46,829 INFO L78 Accepts]: Start accepts. Automaton has 3517 states and 4868 transitions. Word has length 92 [2025-01-09 04:15:46,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:46,829 INFO L471 AbstractCegarLoop]: Abstraction has 3517 states and 4868 transitions. [2025-01-09 04:15:46,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:46,830 INFO L276 IsEmpty]: Start isEmpty. Operand 3517 states and 4868 transitions. [2025-01-09 04:15:46,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:15:46,833 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:46,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:46,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:15:47,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 04:15:47,036 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:47,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:47,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1959798758, now seen corresponding path program 1 times [2025-01-09 04:15:47,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:47,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749617157] [2025-01-09 04:15:47,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:47,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:47,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:15:47,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:15:47,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:47,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:47,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:47,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749617157] [2025-01-09 04:15:47,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749617157] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:47,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828728287] [2025-01-09 04:15:47,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:47,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:47,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:47,122 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 04:15:47,124 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 04:15:47,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:15:47,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:15:47,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:47,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:47,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 04:15:47,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:15:47,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:15:47,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828728287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:47,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:15:47,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 04:15:47,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773247859] [2025-01-09 04:15:47,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:47,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:47,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:47,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:47,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:47,283 INFO L87 Difference]: Start difference. First operand 3517 states and 4868 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:47,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:47,365 INFO L93 Difference]: Finished difference Result 6288 states and 8746 transitions. [2025-01-09 04:15:47,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:47,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2025-01-09 04:15:47,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:47,372 INFO L225 Difference]: With dead ends: 6288 [2025-01-09 04:15:47,373 INFO L226 Difference]: Without dead ends: 2778 [2025-01-09 04:15:47,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:47,377 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 260 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:47,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 414 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:47,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2025-01-09 04:15:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2585. [2025-01-09 04:15:47,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2585 states, 2579 states have (on average 1.3594416440480805) internal successors, (3506), 2583 states have internal predecessors, (3506), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 3511 transitions. [2025-01-09 04:15:47,435 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 3511 transitions. Word has length 142 [2025-01-09 04:15:47,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:47,435 INFO L471 AbstractCegarLoop]: Abstraction has 2585 states and 3511 transitions. [2025-01-09 04:15:47,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:47,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3511 transitions. [2025-01-09 04:15:47,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 04:15:47,437 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:47,437 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:47,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:15:47,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 04:15:47,639 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:47,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:47,639 INFO L85 PathProgramCache]: Analyzing trace with hash 394295546, now seen corresponding path program 1 times [2025-01-09 04:15:47,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:47,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918434225] [2025-01-09 04:15:47,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:47,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:47,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 04:15:47,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 04:15:47,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:47,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:47,851 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:15:47,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:47,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918434225] [2025-01-09 04:15:47,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918434225] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:47,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819430965] [2025-01-09 04:15:47,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:47,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:47,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:47,858 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 04:15:47,859 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 04:15:47,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 04:15:47,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 04:15:47,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:47,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:47,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 04:15:47,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 04:15:48,000 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:15:48,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819430965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:48,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:15:48,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 04:15:48,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637332874] [2025-01-09 04:15:48,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:48,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:48,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:48,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:48,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:48,001 INFO L87 Difference]: Start difference. First operand 2585 states and 3511 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:48,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:48,069 INFO L93 Difference]: Finished difference Result 5017 states and 6854 transitions. [2025-01-09 04:15:48,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:48,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-01-09 04:15:48,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:48,075 INFO L225 Difference]: With dead ends: 5017 [2025-01-09 04:15:48,075 INFO L226 Difference]: Without dead ends: 2585 [2025-01-09 04:15:48,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:48,077 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 272 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:48,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 386 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:48,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2585 states. [2025-01-09 04:15:48,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2585 to 2585. [2025-01-09 04:15:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2585 states, 2579 states have (on average 1.322217913920124) internal successors, (3410), 2583 states have internal predecessors, (3410), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 3415 transitions. [2025-01-09 04:15:48,142 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 3415 transitions. Word has length 145 [2025-01-09 04:15:48,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:48,142 INFO L471 AbstractCegarLoop]: Abstraction has 2585 states and 3415 transitions. [2025-01-09 04:15:48,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:48,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3415 transitions. [2025-01-09 04:15:48,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 04:15:48,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:48,143 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:48,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 04:15:48,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:48,344 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:48,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:48,345 INFO L85 PathProgramCache]: Analyzing trace with hash -381387857, now seen corresponding path program 1 times [2025-01-09 04:15:48,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:48,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766142171] [2025-01-09 04:15:48,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:48,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:48,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 04:15:48,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 04:15:48,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:48,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:48,439 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:15:48,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:48,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766142171] [2025-01-09 04:15:48,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766142171] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:48,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624000656] [2025-01-09 04:15:48,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:48,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:48,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:48,441 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 04:15:48,443 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 04:15:48,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 04:15:48,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 04:15:48,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:48,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:48,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 04:15:48,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:15:48,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:15:48,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624000656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:48,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:15:48,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 04:15:48,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408433158] [2025-01-09 04:15:48,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:48,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:48,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:48,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:48,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:48,565 INFO L87 Difference]: Start difference. First operand 2585 states and 3415 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:48,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:48,806 INFO L93 Difference]: Finished difference Result 5835 states and 7878 transitions. [2025-01-09 04:15:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:48,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2025-01-09 04:15:48,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:48,814 INFO L225 Difference]: With dead ends: 5835 [2025-01-09 04:15:48,814 INFO L226 Difference]: Without dead ends: 3403 [2025-01-09 04:15:48,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:48,817 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 198 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:48,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 638 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:15:48,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2025-01-09 04:15:48,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3323. [2025-01-09 04:15:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3323 states, 3317 states have (on average 1.2894181489297558) internal successors, (4277), 3321 states have internal predecessors, (4277), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:48,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3323 states to 3323 states and 4282 transitions. [2025-01-09 04:15:48,879 INFO L78 Accepts]: Start accepts. Automaton has 3323 states and 4282 transitions. Word has length 146 [2025-01-09 04:15:48,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:48,879 INFO L471 AbstractCegarLoop]: Abstraction has 3323 states and 4282 transitions. [2025-01-09 04:15:48,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:48,879 INFO L276 IsEmpty]: Start isEmpty. Operand 3323 states and 4282 transitions. [2025-01-09 04:15:48,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 04:15:48,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:48,881 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:48,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 04:15:49,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:49,085 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:49,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:49,086 INFO L85 PathProgramCache]: Analyzing trace with hash -484801938, now seen corresponding path program 1 times [2025-01-09 04:15:49,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:49,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313423388] [2025-01-09 04:15:49,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:49,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:49,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 04:15:49,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 04:15:49,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:49,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:15:49,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:49,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313423388] [2025-01-09 04:15:49,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313423388] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:49,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788360464] [2025-01-09 04:15:49,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:49,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:49,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:49,280 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 04:15:49,281 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 04:15:49,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 04:15:49,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 04:15:49,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:49,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:49,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 04:15:49,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:15:49,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:15:49,622 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:15:49,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788360464] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:15:49,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:15:49,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2025-01-09 04:15:49,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559737206] [2025-01-09 04:15:49,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:15:49,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:15:49,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:49,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:15:49,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:15:49,624 INFO L87 Difference]: Start difference. First operand 3323 states and 4282 transitions. Second operand has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:49,963 INFO L93 Difference]: Finished difference Result 8946 states and 11541 transitions. [2025-01-09 04:15:49,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:15:49,963 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2025-01-09 04:15:49,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:49,972 INFO L225 Difference]: With dead ends: 8946 [2025-01-09 04:15:49,972 INFO L226 Difference]: Without dead ends: 5776 [2025-01-09 04:15:49,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:15:49,976 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 879 mSDsluCounter, 3185 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 3708 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:49,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 3708 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:15:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5776 states. [2025-01-09 04:15:50,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5776 to 4743. [2025-01-09 04:15:50,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4743 states, 4737 states have (on average 1.2930124551403843) internal successors, (6125), 4741 states have internal predecessors, (6125), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4743 states to 4743 states and 6130 transitions. [2025-01-09 04:15:50,064 INFO L78 Accepts]: Start accepts. Automaton has 4743 states and 6130 transitions. Word has length 149 [2025-01-09 04:15:50,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:50,064 INFO L471 AbstractCegarLoop]: Abstraction has 4743 states and 6130 transitions. [2025-01-09 04:15:50,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:50,064 INFO L276 IsEmpty]: Start isEmpty. Operand 4743 states and 6130 transitions. [2025-01-09 04:15:50,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-01-09 04:15:50,066 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:50,066 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:50,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 04:15:50,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:50,270 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:50,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:50,271 INFO L85 PathProgramCache]: Analyzing trace with hash -2033982879, now seen corresponding path program 1 times [2025-01-09 04:15:50,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:50,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516682735] [2025-01-09 04:15:50,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:50,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:50,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-01-09 04:15:50,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-01-09 04:15:50,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:50,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 8 proven. 169 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:15:50,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:50,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516682735] [2025-01-09 04:15:50,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516682735] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:50,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125027807] [2025-01-09 04:15:50,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:50,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:50,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:50,687 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 04:15:50,689 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 04:15:50,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-01-09 04:15:50,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-01-09 04:15:50,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:50,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:50,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 04:15:50,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:51,078 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 8 proven. 169 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:15:51,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:15:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 8 proven. 169 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:15:51,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125027807] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:15:51,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:15:51,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2025-01-09 04:15:51,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416940273] [2025-01-09 04:15:51,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:15:51,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 04:15:51,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:51,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 04:15:51,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:15:51,297 INFO L87 Difference]: Start difference. First operand 4743 states and 6130 transitions. Second operand has 11 states, 11 states have (on average 21.636363636363637) internal successors, (238), 11 states have internal predecessors, (238), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:51,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:51,908 INFO L93 Difference]: Finished difference Result 12300 states and 15842 transitions. [2025-01-09 04:15:51,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:15:51,909 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 21.636363636363637) internal successors, (238), 11 states have internal predecessors, (238), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 240 [2025-01-09 04:15:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:51,924 INFO L225 Difference]: With dead ends: 12300 [2025-01-09 04:15:51,924 INFO L226 Difference]: Without dead ends: 7710 [2025-01-09 04:15:51,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:15:51,934 INFO L435 NwaCegarLoop]: 984 mSDtfsCounter, 1484 mSDsluCounter, 7144 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 8128 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:51,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 8128 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:15:51,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7710 states. [2025-01-09 04:15:52,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7710 to 6038. [2025-01-09 04:15:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6038 states, 6032 states have (on average 1.2937665782493368) internal successors, (7804), 6036 states have internal predecessors, (7804), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6038 states to 6038 states and 7809 transitions. [2025-01-09 04:15:52,068 INFO L78 Accepts]: Start accepts. Automaton has 6038 states and 7809 transitions. Word has length 240 [2025-01-09 04:15:52,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:52,069 INFO L471 AbstractCegarLoop]: Abstraction has 6038 states and 7809 transitions. [2025-01-09 04:15:52,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.636363636363637) internal successors, (238), 11 states have internal predecessors, (238), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:52,069 INFO L276 IsEmpty]: Start isEmpty. Operand 6038 states and 7809 transitions. [2025-01-09 04:15:52,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-01-09 04:15:52,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:52,073 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 04:15:52,079 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 04:15:52,274 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,SelfDestructingSolverStorable20 [2025-01-09 04:15:52,274 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:52,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:52,275 INFO L85 PathProgramCache]: Analyzing trace with hash -268742387, now seen corresponding path program 1 times [2025-01-09 04:15:52,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:52,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756767894] [2025-01-09 04:15:52,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:52,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:52,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-01-09 04:15:52,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-01-09 04:15:52,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:52,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:52,765 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 111 proven. 298 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 04:15:52,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:52,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756767894] [2025-01-09 04:15:52,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756767894] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:52,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612169569] [2025-01-09 04:15:52,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:52,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:52,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:52,769 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 04:15:52,773 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 04:15:52,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-01-09 04:15:52,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-01-09 04:15:52,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:52,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:52,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 04:15:52,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:53,230 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 12 proven. 397 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 04:15:53,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:15:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 12 proven. 397 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 04:15:53,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612169569] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:15:53,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:15:53,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 18 [2025-01-09 04:15:53,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851796205] [2025-01-09 04:15:53,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:15:53,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 04:15:53,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:53,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 04:15:53,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:15:53,514 INFO L87 Difference]: Start difference. First operand 6038 states and 7809 transitions. Second operand has 18 states, 18 states have (on average 28.61111111111111) internal successors, (515), 18 states have internal predecessors, (515), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:54,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:54,491 INFO L93 Difference]: Finished difference Result 15535 states and 20008 transitions. [2025-01-09 04:15:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 04:15:54,494 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 28.61111111111111) internal successors, (515), 18 states have internal predecessors, (515), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 332 [2025-01-09 04:15:54,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:54,514 INFO L225 Difference]: With dead ends: 15535 [2025-01-09 04:15:54,514 INFO L226 Difference]: Without dead ends: 9650 [2025-01-09 04:15:54,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 664 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=1530, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 04:15:54,522 INFO L435 NwaCegarLoop]: 1480 mSDtfsCounter, 4577 mSDsluCounter, 14637 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4577 SdHoareTripleChecker+Valid, 16117 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:54,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4577 Valid, 16117 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:15:54,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9650 states. [2025-01-09 04:15:54,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9650 to 7193. [2025-01-09 04:15:54,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7193 states, 7187 states have (on average 1.2960901627939334) internal successors, (9315), 7191 states have internal predecessors, (9315), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:54,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7193 states to 7193 states and 9320 transitions. [2025-01-09 04:15:54,707 INFO L78 Accepts]: Start accepts. Automaton has 7193 states and 9320 transitions. Word has length 332 [2025-01-09 04:15:54,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:54,708 INFO L471 AbstractCegarLoop]: Abstraction has 7193 states and 9320 transitions. [2025-01-09 04:15:54,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 28.61111111111111) internal successors, (515), 18 states have internal predecessors, (515), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:54,708 INFO L276 IsEmpty]: Start isEmpty. Operand 7193 states and 9320 transitions. [2025-01-09 04:15:54,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-01-09 04:15:54,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:54,714 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:54,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 04:15:54,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:54,915 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:54,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:54,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1103621800, now seen corresponding path program 1 times [2025-01-09 04:15:54,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:54,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91191460] [2025-01-09 04:15:54,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:54,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:54,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-01-09 04:15:54,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-01-09 04:15:54,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:54,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-01-09 04:15:54,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:54,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91191460] [2025-01-09 04:15:54,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91191460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:54,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:54,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:54,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406140579] [2025-01-09 04:15:54,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:54,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:54,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:54,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:54,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:54,999 INFO L87 Difference]: Start difference. First operand 7193 states and 9320 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:55,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:55,116 INFO L93 Difference]: Finished difference Result 8702 states and 11065 transitions. [2025-01-09 04:15:55,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:55,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 425 [2025-01-09 04:15:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:55,123 INFO L225 Difference]: With dead ends: 8702 [2025-01-09 04:15:55,124 INFO L226 Difference]: Without dead ends: 1559 [2025-01-09 04:15:55,128 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 04:15:55,129 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 131 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:55,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 372 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:15:55,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2025-01-09 04:15:55,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1011. [2025-01-09 04:15:55,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1007 states have (on average 1.0814299900695135) internal successors, (1089), 1009 states have internal predecessors, (1089), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1092 transitions. [2025-01-09 04:15:55,186 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1092 transitions. Word has length 425 [2025-01-09 04:15:55,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:55,186 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1092 transitions. [2025-01-09 04:15:55,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:55,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1092 transitions. [2025-01-09 04:15:55,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-01-09 04:15:55,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:55,191 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:55,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:15:55,191 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:55,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:55,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1560523578, now seen corresponding path program 1 times [2025-01-09 04:15:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:55,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075259712] [2025-01-09 04:15:55,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:55,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:55,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-01-09 04:15:55,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-01-09 04:15:55,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:55,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-01-09 04:15:55,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:55,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075259712] [2025-01-09 04:15:55,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075259712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:55,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:55,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:15:55,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566734026] [2025-01-09 04:15:55,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:55,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:15:55,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:55,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:15:55,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:15:55,348 INFO L87 Difference]: Start difference. First operand 1011 states and 1092 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:55,456 INFO L93 Difference]: Finished difference Result 1385 states and 1518 transitions. [2025-01-09 04:15:55,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:15:55,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 426 [2025-01-09 04:15:55,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:55,461 INFO L225 Difference]: With dead ends: 1385 [2025-01-09 04:15:55,461 INFO L226 Difference]: Without dead ends: 1194 [2025-01-09 04:15:55,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:15:55,462 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 212 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:55,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1423 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:15:55,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2025-01-09 04:15:55,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1073. [2025-01-09 04:15:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 1069 states have (on average 1.0832553788587465) internal successors, (1158), 1071 states have internal predecessors, (1158), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1161 transitions. [2025-01-09 04:15:55,496 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1161 transitions. Word has length 426 [2025-01-09 04:15:55,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:55,497 INFO L471 AbstractCegarLoop]: Abstraction has 1073 states and 1161 transitions. [2025-01-09 04:15:55,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1161 transitions. [2025-01-09 04:15:55,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-01-09 04:15:55,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:55,501 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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 04:15:55,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:15:55,501 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:55,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:55,502 INFO L85 PathProgramCache]: Analyzing trace with hash 131716127, now seen corresponding path program 1 times [2025-01-09 04:15:55,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:55,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37542583] [2025-01-09 04:15:55,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:55,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:55,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-01-09 04:15:55,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-01-09 04:15:55,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:55,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-01-09 04:15:55,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:55,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37542583] [2025-01-09 04:15:55,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37542583] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:55,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:55,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:15:55,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177542452] [2025-01-09 04:15:55,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:55,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:15:55,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:55,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:15:55,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:15:55,610 INFO L87 Difference]: Start difference. First operand 1073 states and 1161 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:55,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:55,664 INFO L93 Difference]: Finished difference Result 1255 states and 1362 transitions. [2025-01-09 04:15:55,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:15:55,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 427 [2025-01-09 04:15:55,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:55,668 INFO L225 Difference]: With dead ends: 1255 [2025-01-09 04:15:55,668 INFO L226 Difference]: Without dead ends: 1064 [2025-01-09 04:15:55,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:15:55,669 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 174 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:55,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 817 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:55,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2025-01-09 04:15:55,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1060. [2025-01-09 04:15:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 1057 states have (on average 1.0709555345316935) internal successors, (1132), 1058 states have internal predecessors, (1132), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1134 transitions. [2025-01-09 04:15:55,698 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1134 transitions. Word has length 427 [2025-01-09 04:15:55,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:55,699 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1134 transitions. [2025-01-09 04:15:55,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:55,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1134 transitions. [2025-01-09 04:15:55,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-01-09 04:15:55,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:55,703 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:55,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:15:55,704 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:55,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:55,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1917545221, now seen corresponding path program 1 times [2025-01-09 04:15:55,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:55,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916027045] [2025-01-09 04:15:55,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:55,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:55,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-01-09 04:15:55,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-01-09 04:15:55,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:55,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 84 proven. 220 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-01-09 04:15:56,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:56,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916027045] [2025-01-09 04:15:56,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916027045] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:56,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402331778] [2025-01-09 04:15:56,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:56,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:56,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:56,415 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 04:15:56,422 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 04:15:56,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-01-09 04:15:56,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-01-09 04:15:56,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:56,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:56,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 1400 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 04:15:56,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 84 proven. 220 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-01-09 04:15:57,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:15:57,674 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 20 proven. 284 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-01-09 04:15:57,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402331778] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:15:57,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:15:57,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 28 [2025-01-09 04:15:57,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154641432] [2025-01-09 04:15:57,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:15:57,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 04:15:57,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:57,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 04:15:57,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:15:57,677 INFO L87 Difference]: Start difference. First operand 1060 states and 1134 transitions. Second operand has 28 states, 28 states have (on average 13.035714285714286) internal successors, (365), 28 states have internal predecessors, (365), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:58,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:58,086 INFO L93 Difference]: Finished difference Result 1180 states and 1258 transitions. [2025-01-09 04:15:58,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 04:15:58,087 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 13.035714285714286) internal successors, (365), 28 states have internal predecessors, (365), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 480 [2025-01-09 04:15:58,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:58,091 INFO L225 Difference]: With dead ends: 1180 [2025-01-09 04:15:58,091 INFO L226 Difference]: Without dead ends: 1177 [2025-01-09 04:15:58,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 992 GetRequests, 952 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=1541, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 04:15:58,093 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 794 mSDsluCounter, 5499 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 5864 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:58,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 5864 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:15:58,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2025-01-09 04:15:58,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1152. [2025-01-09 04:15:58,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1149 states have (on average 1.0687554395126198) internal successors, (1228), 1150 states have internal predecessors, (1228), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:58,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1230 transitions. [2025-01-09 04:15:58,122 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1230 transitions. Word has length 480 [2025-01-09 04:15:58,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:58,123 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1230 transitions. [2025-01-09 04:15:58,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 13.035714285714286) internal successors, (365), 28 states have internal predecessors, (365), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:58,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1230 transitions. [2025-01-09 04:15:58,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2025-01-09 04:15:58,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:58,126 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:58,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 04:15:58,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 04:15:58,330 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:58,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:58,331 INFO L85 PathProgramCache]: Analyzing trace with hash 714242654, now seen corresponding path program 1 times [2025-01-09 04:15:58,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:58,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918123007] [2025-01-09 04:15:58,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:58,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:58,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes. [2025-01-09 04:15:58,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 524 of 524 statements. [2025-01-09 04:15:58,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:58,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:58,647 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 248 proven. 41 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2025-01-09 04:15:58,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:58,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918123007] [2025-01-09 04:15:58,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918123007] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:58,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834903157] [2025-01-09 04:15:58,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:58,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:58,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:58,650 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 04:15:58,659 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 04:15:58,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes. [2025-01-09 04:15:58,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 524 of 524 statements. [2025-01-09 04:15:58,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:58,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:58,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 1521 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 04:15:58,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 248 proven. 41 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2025-01-09 04:15:58,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:15:59,094 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 248 proven. 41 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2025-01-09 04:15:59,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834903157] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:15:59,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:15:59,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2025-01-09 04:15:59,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095107571] [2025-01-09 04:15:59,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:15:59,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:15:59,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:59,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:15:59,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:15:59,096 INFO L87 Difference]: Start difference. First operand 1152 states and 1230 transitions. Second operand has 9 states, 9 states have (on average 29.0) internal successors, (261), 9 states have internal predecessors, (261), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:59,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:59,268 INFO L93 Difference]: Finished difference Result 1516 states and 1624 transitions. [2025-01-09 04:15:59,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:15:59,268 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 29.0) internal successors, (261), 9 states have internal predecessors, (261), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 524 [2025-01-09 04:15:59,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:59,273 INFO L225 Difference]: With dead ends: 1516 [2025-01-09 04:15:59,273 INFO L226 Difference]: Without dead ends: 1338 [2025-01-09 04:15:59,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1066 GetRequests, 1053 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:15:59,274 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 373 mSDsluCounter, 1993 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 2331 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:59,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 2331 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:15:59,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-01-09 04:15:59,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1230. [2025-01-09 04:15:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1227 states have (on average 1.0684596577017116) internal successors, (1311), 1228 states have internal predecessors, (1311), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1313 transitions. [2025-01-09 04:15:59,311 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1313 transitions. Word has length 524 [2025-01-09 04:15:59,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:59,312 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1313 transitions. [2025-01-09 04:15:59,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.0) internal successors, (261), 9 states have internal predecessors, (261), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1313 transitions. [2025-01-09 04:15:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-01-09 04:15:59,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:59,316 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:59,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 04:15:59,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:59,517 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:59,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:59,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1641940549, now seen corresponding path program 1 times [2025-01-09 04:15:59,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:59,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246009675] [2025-01-09 04:15:59,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:59,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:59,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-01-09 04:15:59,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-01-09 04:15:59,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:59,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:00,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 167 proven. 643 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-01-09 04:16:00,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:00,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246009675] [2025-01-09 04:16:00,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246009675] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:16:00,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102339674] [2025-01-09 04:16:00,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:00,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:16:00,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:16:00,250 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 04:16:00,251 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 04:16:00,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-01-09 04:16:00,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-01-09 04:16:00,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:00,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:00,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 1656 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 04:16:00,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:16:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 210 proven. 600 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-01-09 04:16:01,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:16:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 24 proven. 786 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-01-09 04:16:01,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102339674] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:16:01,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:16:01,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 32 [2025-01-09 04:16:01,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694358664] [2025-01-09 04:16:01,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:16:01,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 04:16:01,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:01,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 04:16:01,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=912, Unknown=0, NotChecked=0, Total=992 [2025-01-09 04:16:01,878 INFO L87 Difference]: Start difference. First operand 1230 states and 1313 transitions. Second operand has 32 states, 32 states have (on average 19.84375) internal successors, (635), 32 states have internal predecessors, (635), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:16:02,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:02,517 INFO L93 Difference]: Finished difference Result 1350 states and 1437 transitions. [2025-01-09 04:16:02,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 04:16:02,517 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 19.84375) internal successors, (635), 32 states have internal predecessors, (635), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 579 [2025-01-09 04:16:02,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:02,522 INFO L225 Difference]: With dead ends: 1350 [2025-01-09 04:16:02,522 INFO L226 Difference]: Without dead ends: 1347 [2025-01-09 04:16:02,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1200 GetRequests, 1151 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=2319, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 04:16:02,523 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 950 mSDsluCounter, 12099 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 12658 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:02,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 12658 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:16:02,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2025-01-09 04:16:02,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1322. [2025-01-09 04:16:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 1319 states have (on average 1.0667172100075815) internal successors, (1407), 1320 states have internal predecessors, (1407), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:16:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1409 transitions. [2025-01-09 04:16:02,561 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1409 transitions. Word has length 579 [2025-01-09 04:16:02,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:02,562 INFO L471 AbstractCegarLoop]: Abstraction has 1322 states and 1409 transitions. [2025-01-09 04:16:02,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 19.84375) internal successors, (635), 32 states have internal predecessors, (635), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:16:02,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1409 transitions. [2025-01-09 04:16:02,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2025-01-09 04:16:02,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:02,565 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:02,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 04:16:02,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-09 04:16:02,767 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:02,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:02,767 INFO L85 PathProgramCache]: Analyzing trace with hash -2061945442, now seen corresponding path program 1 times [2025-01-09 04:16:02,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:02,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498298116] [2025-01-09 04:16:02,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:02,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:02,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-01-09 04:16:02,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-01-09 04:16:02,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:02,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:03,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 416 proven. 185 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-01-09 04:16:03,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:03,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498298116] [2025-01-09 04:16:03,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498298116] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:16:03,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579208347] [2025-01-09 04:16:03,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:03,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:16:03,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:16:03,165 INFO L229 MonitoredProcess]: Starting monitored process 12 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 04:16:03,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 04:16:03,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-01-09 04:16:03,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-01-09 04:16:03,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:03,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:03,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 1777 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 04:16:03,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:16:03,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 416 proven. 185 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-01-09 04:16:03,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:16:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 416 proven. 185 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-01-09 04:16:03,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579208347] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:16:03,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:16:03,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2025-01-09 04:16:03,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85967269] [2025-01-09 04:16:03,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:16:03,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 04:16:03,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:03,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 04:16:03,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:16:03,770 INFO L87 Difference]: Start difference. First operand 1322 states and 1409 transitions. Second operand has 11 states, 11 states have (on average 32.72727272727273) internal successors, (360), 11 states have internal predecessors, (360), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:16:04,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:04,005 INFO L93 Difference]: Finished difference Result 1692 states and 1811 transitions. [2025-01-09 04:16:04,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:16:04,005 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 32.72727272727273) internal successors, (360), 11 states have internal predecessors, (360), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 623 [2025-01-09 04:16:04,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:04,010 INFO L225 Difference]: With dead ends: 1692 [2025-01-09 04:16:04,010 INFO L226 Difference]: Without dead ends: 1514 [2025-01-09 04:16:04,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1270 GetRequests, 1253 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:16:04,011 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 547 mSDsluCounter, 3750 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 4257 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:04,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 4257 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:16:04,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2025-01-09 04:16:04,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1402. [2025-01-09 04:16:04,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1399 states have (on average 1.0664760543245175) internal successors, (1492), 1400 states have internal predecessors, (1492), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:16:04,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1494 transitions. [2025-01-09 04:16:04,050 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1494 transitions. Word has length 623 [2025-01-09 04:16:04,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:04,050 INFO L471 AbstractCegarLoop]: Abstraction has 1402 states and 1494 transitions. [2025-01-09 04:16:04,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.72727272727273) internal successors, (360), 11 states have internal predecessors, (360), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:16:04,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1494 transitions. [2025-01-09 04:16:04,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2025-01-09 04:16:04,053 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:04,054 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 04:16:04,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 04:16:04,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-09 04:16:04,254 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:04,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:04,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1370398792, now seen corresponding path program 1 times [2025-01-09 04:16:04,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:04,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73320769] [2025-01-09 04:16:04,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:04,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:04,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes. [2025-01-09 04:16:04,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements. [2025-01-09 04:16:04,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:04,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:06,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 116 proven. 1228 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 04:16:06,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:06,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73320769] [2025-01-09 04:16:06,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73320769] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:16:06,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566010517] [2025-01-09 04:16:06,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:06,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:16:06,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:16:06,300 INFO L229 MonitoredProcess]: Starting monitored process 13 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 04:16:06,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 04:16:06,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes. [2025-01-09 04:16:06,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements. [2025-01-09 04:16:06,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:06,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:06,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 1913 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-01-09 04:16:06,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:16:07,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 256 proven. 1073 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-01-09 04:16:07,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:16:08,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 28 proven. 1301 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-01-09 04:16:08,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566010517] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:16:08,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:16:08,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 40 [2025-01-09 04:16:08,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877125163] [2025-01-09 04:16:08,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:16:08,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-01-09 04:16:08,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:08,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-09 04:16:08,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1454, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 04:16:08,335 INFO L87 Difference]: Start difference. First operand 1402 states and 1494 transitions. Second operand has 40 states, 40 states have (on average 23.6) internal successors, (944), 40 states have internal predecessors, (944), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:16:09,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:09,244 INFO L93 Difference]: Finished difference Result 1531 states and 1627 transitions. [2025-01-09 04:16:09,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 04:16:09,244 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 23.6) internal successors, (944), 40 states have internal predecessors, (944), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 679 [2025-01-09 04:16:09,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:09,250 INFO L225 Difference]: With dead ends: 1531 [2025-01-09 04:16:09,251 INFO L226 Difference]: Without dead ends: 1528 [2025-01-09 04:16:09,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1411 GetRequests, 1350 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=3619, Unknown=0, NotChecked=0, Total=3906 [2025-01-09 04:16:09,255 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 1057 mSDsluCounter, 19307 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 20092 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:09,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 20092 Invalid, 1698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:16:09,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2025-01-09 04:16:09,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1494. [2025-01-09 04:16:09,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1491 states have (on average 1.0650570087189806) internal successors, (1588), 1492 states have internal predecessors, (1588), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:16:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1590 transitions. [2025-01-09 04:16:09,302 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1590 transitions. Word has length 679 [2025-01-09 04:16:09,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:09,303 INFO L471 AbstractCegarLoop]: Abstraction has 1494 states and 1590 transitions. [2025-01-09 04:16:09,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 23.6) internal successors, (944), 40 states have internal predecessors, (944), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:16:09,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1590 transitions. [2025-01-09 04:16:09,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2025-01-09 04:16:09,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:09,307 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 04:16:09,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 04:16:09,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:16:09,511 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:09,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:09,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1964872047, now seen corresponding path program 1 times [2025-01-09 04:16:09,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:09,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795612707] [2025-01-09 04:16:09,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:09,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:09,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 723 statements into 1 equivalence classes. [2025-01-09 04:16:09,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 723 of 723 statements. [2025-01-09 04:16:09,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:09,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1602 backedges. 676 proven. 573 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-01-09 04:16:10,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:10,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795612707] [2025-01-09 04:16:10,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795612707] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:16:10,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260754947] [2025-01-09 04:16:10,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:10,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:16:10,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:16:10,718 INFO L229 MonitoredProcess]: Starting monitored process 14 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 04:16:10,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 04:16:10,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 723 statements into 1 equivalence classes. [2025-01-09 04:16:10,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 723 of 723 statements. [2025-01-09 04:16:10,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:10,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:10,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 2034 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 04:16:10,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:16:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1602 backedges. 584 proven. 433 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2025-01-09 04:16:11,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:16:11,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1602 backedges. 584 proven. 433 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2025-01-09 04:16:11,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260754947] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:16:11,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:16:11,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 29 [2025-01-09 04:16:11,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842520849] [2025-01-09 04:16:11,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:16:11,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 04:16:11,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:11,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 04:16:11,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=751, Unknown=0, NotChecked=0, Total=812 [2025-01-09 04:16:11,597 INFO L87 Difference]: Start difference. First operand 1494 states and 1590 transitions. Second operand has 29 states, 29 states have (on average 26.862068965517242) internal successors, (779), 29 states have internal predecessors, (779), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:16:13,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:13,991 INFO L93 Difference]: Finished difference Result 2005 states and 2139 transitions. [2025-01-09 04:16:13,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-01-09 04:16:13,991 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 26.862068965517242) internal successors, (779), 29 states have internal predecessors, (779), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 723 [2025-01-09 04:16:13,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:13,997 INFO L225 Difference]: With dead ends: 2005 [2025-01-09 04:16:13,997 INFO L226 Difference]: Without dead ends: 1827 [2025-01-09 04:16:14,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1560 GetRequests, 1461 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2764 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=727, Invalid=9373, Unknown=0, NotChecked=0, Total=10100 [2025-01-09 04:16:14,000 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 2389 mSDsluCounter, 18485 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2389 SdHoareTripleChecker+Valid, 19364 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:14,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2389 Valid, 19364 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 04:16:14,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2025-01-09 04:16:14,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1668. [2025-01-09 04:16:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1665 states have (on average 1.0642642642642643) internal successors, (1772), 1666 states have internal predecessors, (1772), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:16:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 1774 transitions. [2025-01-09 04:16:14,058 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 1774 transitions. Word has length 723 [2025-01-09 04:16:14,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:14,059 INFO L471 AbstractCegarLoop]: Abstraction has 1668 states and 1774 transitions. [2025-01-09 04:16:14,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 26.862068965517242) internal successors, (779), 29 states have internal predecessors, (779), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:16:14,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 1774 transitions. [2025-01-09 04:16:14,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2025-01-09 04:16:14,062 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:14,063 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 04:16:14,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-09 04:16:14,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:16:14,263 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:14,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:14,264 INFO L85 PathProgramCache]: Analyzing trace with hash -625808211, now seen corresponding path program 1 times [2025-01-09 04:16:14,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:14,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138184984] [2025-01-09 04:16:14,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:14,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:14,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 780 statements into 1 equivalence classes. [2025-01-09 04:16:14,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 780 of 780 statements. [2025-01-09 04:16:14,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:14,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1869 backedges. 78 proven. 1778 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:16:16,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:16,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138184984] [2025-01-09 04:16:16,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138184984] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:16:16,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700025757] [2025-01-09 04:16:16,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:16,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:16:16,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:16:16,012 INFO L229 MonitoredProcess]: Starting monitored process 15 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 04:16:16,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 04:16:16,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 780 statements into 1 equivalence classes. [2025-01-09 04:16:16,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 780 of 780 statements. [2025-01-09 04:16:16,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:16,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:16,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 2171 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-01-09 04:16:16,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:16:17,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1869 backedges. 218 proven. 1638 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:16:17,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:16:18,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1869 backedges. 32 proven. 1824 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:16:18,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700025757] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:16:18,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:16:18,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 46 [2025-01-09 04:16:18,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534768710] [2025-01-09 04:16:18,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:16:18,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-09 04:16:18,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:18,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-09 04:16:18,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1946, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 04:16:18,512 INFO L87 Difference]: Start difference. First operand 1668 states and 1774 transitions. Second operand has 46 states, 46 states have (on average 26.0) internal successors, (1196), 46 states have internal predecessors, (1196), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:16:19,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:19,868 INFO L93 Difference]: Finished difference Result 3010 states and 3194 transitions. [2025-01-09 04:16:19,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-01-09 04:16:19,868 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 26.0) internal successors, (1196), 46 states have internal predecessors, (1196), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 780 [2025-01-09 04:16:19,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:19,876 INFO L225 Difference]: With dead ends: 3010 [2025-01-09 04:16:19,876 INFO L226 Difference]: Without dead ends: 3007 [2025-01-09 04:16:19,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1624 GetRequests, 1552 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=341, Invalid=5061, Unknown=0, NotChecked=0, Total=5402 [2025-01-09 04:16:19,881 INFO L435 NwaCegarLoop]: 1016 mSDtfsCounter, 1876 mSDsluCounter, 29636 mSDsCounter, 0 mSdLazyCounter, 2579 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1876 SdHoareTripleChecker+Valid, 30652 SdHoareTripleChecker+Invalid, 2593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:19,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1876 Valid, 30652 Invalid, 2593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2579 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:16:19,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2025-01-09 04:16:20,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2518. [2025-01-09 04:16:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2515 states have (on average 1.060834990059642) internal successors, (2668), 2516 states have internal predecessors, (2668), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:16:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 2670 transitions. [2025-01-09 04:16:20,060 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 2670 transitions. Word has length 780 [2025-01-09 04:16:20,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:20,063 INFO L471 AbstractCegarLoop]: Abstraction has 2518 states and 2670 transitions. [2025-01-09 04:16:20,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 26.0) internal successors, (1196), 46 states have internal predecessors, (1196), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:16:20,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 2670 transitions. [2025-01-09 04:16:20,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 825 [2025-01-09 04:16:20,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:20,077 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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 04:16:20,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-09 04:16:20,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-01-09 04:16:20,280 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:20,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:20,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1341923334, now seen corresponding path program 1 times [2025-01-09 04:16:20,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:20,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647017328] [2025-01-09 04:16:20,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:20,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:20,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 824 statements into 1 equivalence classes. [2025-01-09 04:16:20,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 824 of 824 statements. [2025-01-09 04:16:20,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:20,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2125 backedges. 380 proven. 1358 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2025-01-09 04:16:21,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:21,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647017328] [2025-01-09 04:16:21,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647017328] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:16:21,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883408017] [2025-01-09 04:16:21,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:21,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:16:21,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:16:21,563 INFO L229 MonitoredProcess]: Starting monitored process 16 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 04:16:21,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-09 04:16:21,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 824 statements into 1 equivalence classes. [2025-01-09 04:16:21,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 824 of 824 statements. [2025-01-09 04:16:21,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:21,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:21,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 2292 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 04:16:21,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:16:22,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2125 backedges. 1538 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2025-01-09 04:16:22,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:16:22,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883408017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:22,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:16:22,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [23] total 26 [2025-01-09 04:16:22,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364787280] [2025-01-09 04:16:22,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:22,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 04:16:22,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:22,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 04:16:22,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2025-01-09 04:16:22,318 INFO L87 Difference]: Start difference. First operand 2518 states and 2670 transitions. Second operand has 11 states, 11 states have (on average 51.0) internal successors, (561), 11 states have internal predecessors, (561), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:16:22,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:22,618 INFO L93 Difference]: Finished difference Result 2534 states and 2686 transitions. [2025-01-09 04:16:22,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:16:22,619 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 51.0) internal successors, (561), 11 states have internal predecessors, (561), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 824 [2025-01-09 04:16:22,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:22,624 INFO L225 Difference]: With dead ends: 2534 [2025-01-09 04:16:22,624 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 04:16:22,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 867 GetRequests, 834 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 04:16:22,627 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 687 mSDsluCounter, 2084 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 2798 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:22,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 2798 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:16:22,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 04:16:22,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 04:16:22,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 04:16:22,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 04:16:22,632 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 824 [2025-01-09 04:16:22,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:22,632 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 04:16:22,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 51.0) internal successors, (561), 11 states have internal predecessors, (561), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:16:22,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 04:16:22,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 04:16:22,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:16:22,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-09 04:16:22,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:16:22,844 INFO L422 BasicCegarLoop]: Path program 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] [2025-01-09 04:16:22,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.