./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label16.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/eca-rers2012/Problem03_label16.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 b3ca7ac045e48d38881d30e6a93ef4c7dacfed0b5d9d8607f5d28bf43102d8b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:45:58,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:45:58,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:45:58,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:45:58,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:45:58,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:45:58,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:45:58,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:45:58,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:45:58,167 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:45:58,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:45:58,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:45:58,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:45:58,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:45:58,168 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:45:58,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:45:58,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:45:58,168 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:45:58,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:45:58,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:45:58,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:45:58,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:45:58,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:45:58,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:45:58,169 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:45:58,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:45:58,169 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:45:58,169 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:45:58,169 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:45:58,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:45:58,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:45:58,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:45:58,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:45:58,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:45:58,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:45:58,170 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:45:58,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:45:58,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:45:58,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:45:58,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:45:58,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:45:58,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:45:58,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:45:58,171 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 -> b3ca7ac045e48d38881d30e6a93ef4c7dacfed0b5d9d8607f5d28bf43102d8b7 [2025-02-05 10:45:58,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:45:58,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:45:58,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:45:58,429 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:45:58,429 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:45:58,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label16.c [2025-02-05 10:45:59,617 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b81cd045/caa4c3aa96834f5caab9cc94ccdd2ffa/FLAGe32bf0cc7 [2025-02-05 10:45:59,936 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:45:59,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label16.c [2025-02-05 10:45:59,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b81cd045/caa4c3aa96834f5caab9cc94ccdd2ffa/FLAGe32bf0cc7 [2025-02-05 10:45:59,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b81cd045/caa4c3aa96834f5caab9cc94ccdd2ffa [2025-02-05 10:45:59,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:45:59,967 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:45:59,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:45:59,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:45:59,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:45:59,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:45:59" (1/1) ... [2025-02-05 10:45:59,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@240f8d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:45:59, skipping insertion in model container [2025-02-05 10:45:59,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:45:59" (1/1) ... [2025-02-05 10:46:00,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:46:00,309 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/eca-rers2012/Problem03_label16.c[56490,56503] [2025-02-05 10:46:00,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:46:00,341 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:46:00,463 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/eca-rers2012/Problem03_label16.c[56490,56503] [2025-02-05 10:46:00,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:46:00,490 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:46:00,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:46:00 WrapperNode [2025-02-05 10:46:00,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:46:00,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:46:00,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:46:00,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:46:00,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:46:00" (1/1) ... [2025-02-05 10:46:00,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:46:00" (1/1) ... [2025-02-05 10:46:00,601 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-02-05 10:46:00,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:46:00,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:46:00,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:46:00,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:46:00,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:46:00" (1/1) ... [2025-02-05 10:46:00,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:46:00" (1/1) ... [2025-02-05 10:46:00,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:46:00" (1/1) ... [2025-02-05 10:46:00,657 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-02-05 10:46:00,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:46:00" (1/1) ... [2025-02-05 10:46:00,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:46:00" (1/1) ... [2025-02-05 10:46:00,688 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:46:00" (1/1) ... [2025-02-05 10:46:00,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:46:00" (1/1) ... [2025-02-05 10:46:00,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:46:00" (1/1) ... [2025-02-05 10:46:00,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:46:00" (1/1) ... [2025-02-05 10:46:00,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:46:00,713 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:46:00,714 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:46:00,714 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:46:00,715 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:46:00" (1/1) ... [2025-02-05 10:46:00,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:46:00,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:46:00,743 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-02-05 10:46:00,749 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-02-05 10:46:00,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:46:00,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:46:00,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:46:00,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:46:00,832 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:46:00,833 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:46:02,218 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-02-05 10:46:02,219 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:46:02,236 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:46:02,240 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:46:02,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:46:02 BoogieIcfgContainer [2025-02-05 10:46:02,240 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:46:02,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:46:02,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:46:02,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:46:02,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:45:59" (1/3) ... [2025-02-05 10:46:02,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14fd1c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:46:02, skipping insertion in model container [2025-02-05 10:46:02,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:46:00" (2/3) ... [2025-02-05 10:46:02,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14fd1c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:46:02, skipping insertion in model container [2025-02-05 10:46:02,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:46:02" (3/3) ... [2025-02-05 10:46:02,249 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label16.c [2025-02-05 10:46:02,260 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:46:02,266 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label16.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:46:02,323 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:46:02,335 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;@1c9245e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:46:02,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:46:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 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-02-05 10:46:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 10:46:02,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:02,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:46:02,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:02,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:02,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1285694089, now seen corresponding path program 1 times [2025-02-05 10:46:02,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:02,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301533299] [2025-02-05 10:46:02,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:02,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:02,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 10:46:02,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 10:46:02,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:02,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:46:03,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:03,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301533299] [2025-02-05 10:46:03,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301533299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:03,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:46:03,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:46:03,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645983142] [2025-02-05 10:46:03,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:03,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:46:03,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:03,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:46:03,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:46:03,172 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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-02-05 10:46:04,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:04,076 INFO L93 Difference]: Finished difference Result 810 states and 1442 transitions. [2025-02-05 10:46:04,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:04,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2025-02-05 10:46:04,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:04,086 INFO L225 Difference]: With dead ends: 810 [2025-02-05 10:46:04,086 INFO L226 Difference]: Without dead ends: 444 [2025-02-05 10:46:04,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:46:04,091 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 89 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:04,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 231 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 10:46:04,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-02-05 10:46:04,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-02-05 10:46:04,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 1.4288939051918736) internal successors, (633), 443 states have internal predecessors, (633), 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-02-05 10:46:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 633 transitions. [2025-02-05 10:46:04,151 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 633 transitions. Word has length 165 [2025-02-05 10:46:04,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:04,152 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 633 transitions. [2025-02-05 10:46:04,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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-02-05 10:46:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 633 transitions. [2025-02-05 10:46:04,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 10:46:04,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:04,158 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:46:04,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:46:04,158 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:04,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:04,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1937666829, now seen corresponding path program 1 times [2025-02-05 10:46:04,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:04,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568831403] [2025-02-05 10:46:04,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:04,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:04,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-05 10:46:04,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 10:46:04,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:04,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:46:04,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:04,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568831403] [2025-02-05 10:46:04,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568831403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:04,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:46:04,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:46:04,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093642697] [2025-02-05 10:46:04,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:04,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:46:04,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:04,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:46:04,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:46:04,342 INFO L87 Difference]: Start difference. First operand 444 states and 633 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 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-02-05 10:46:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:05,000 INFO L93 Difference]: Finished difference Result 1312 states and 1878 transitions. [2025-02-05 10:46:05,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:05,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2025-02-05 10:46:05,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:05,004 INFO L225 Difference]: With dead ends: 1312 [2025-02-05 10:46:05,004 INFO L226 Difference]: Without dead ends: 870 [2025-02-05 10:46:05,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:46:05,008 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:05,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 91 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:46:05,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-02-05 10:46:05,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 856. [2025-02-05 10:46:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 855 states have (on average 1.3953216374269006) internal successors, (1193), 855 states have internal predecessors, (1193), 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-02-05 10:46:05,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1193 transitions. [2025-02-05 10:46:05,047 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1193 transitions. Word has length 173 [2025-02-05 10:46:05,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:05,047 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1193 transitions. [2025-02-05 10:46:05,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 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-02-05 10:46:05,048 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1193 transitions. [2025-02-05 10:46:05,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-05 10:46:05,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:05,051 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:46:05,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:46:05,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:05,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:05,052 INFO L85 PathProgramCache]: Analyzing trace with hash -286407858, now seen corresponding path program 1 times [2025-02-05 10:46:05,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:05,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480379689] [2025-02-05 10:46:05,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:05,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:05,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-05 10:46:05,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-05 10:46:05,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:05,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:05,279 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:46:05,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:05,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480379689] [2025-02-05 10:46:05,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480379689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:05,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:46:05,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:46:05,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227272601] [2025-02-05 10:46:05,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:05,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:46:05,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:05,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:46:05,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:46:05,281 INFO L87 Difference]: Start difference. First operand 856 states and 1193 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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-02-05 10:46:05,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:05,969 INFO L93 Difference]: Finished difference Result 2541 states and 3551 transitions. [2025-02-05 10:46:05,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:05,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2025-02-05 10:46:05,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:05,975 INFO L225 Difference]: With dead ends: 2541 [2025-02-05 10:46:05,975 INFO L226 Difference]: Without dead ends: 1687 [2025-02-05 10:46:05,976 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-02-05 10:46:05,977 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 79 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:05,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 365 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:46:05,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2025-02-05 10:46:05,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1673. [2025-02-05 10:46:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1672 states have (on average 1.3600478468899522) internal successors, (2274), 1672 states have internal predecessors, (2274), 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-02-05 10:46:06,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2274 transitions. [2025-02-05 10:46:06,005 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2274 transitions. Word has length 180 [2025-02-05 10:46:06,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:06,005 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 2274 transitions. [2025-02-05 10:46:06,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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-02-05 10:46:06,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2274 transitions. [2025-02-05 10:46:06,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-05 10:46:06,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:06,008 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:46:06,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:46:06,009 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:06,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:06,009 INFO L85 PathProgramCache]: Analyzing trace with hash 314173971, now seen corresponding path program 1 times [2025-02-05 10:46:06,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:06,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366324116] [2025-02-05 10:46:06,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:06,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:06,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-05 10:46:06,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-05 10:46:06,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:06,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:06,152 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:46:06,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:06,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366324116] [2025-02-05 10:46:06,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366324116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:06,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:46:06,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:46:06,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090538154] [2025-02-05 10:46:06,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:06,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:46:06,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:06,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:46:06,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:46:06,155 INFO L87 Difference]: Start difference. First operand 1673 states and 2274 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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-02-05 10:46:06,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:06,809 INFO L93 Difference]: Finished difference Result 4976 states and 6770 transitions. [2025-02-05 10:46:06,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:06,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 186 [2025-02-05 10:46:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:06,819 INFO L225 Difference]: With dead ends: 4976 [2025-02-05 10:46:06,819 INFO L226 Difference]: Without dead ends: 3305 [2025-02-05 10:46:06,821 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-02-05 10:46:06,822 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 258 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:06,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 357 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:46:06,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2025-02-05 10:46:06,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 3300. [2025-02-05 10:46:06,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3299 states have (on average 1.3100939678690513) internal successors, (4322), 3299 states have internal predecessors, (4322), 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-02-05 10:46:06,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 4322 transitions. [2025-02-05 10:46:06,873 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 4322 transitions. Word has length 186 [2025-02-05 10:46:06,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:06,873 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 4322 transitions. [2025-02-05 10:46:06,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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-02-05 10:46:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 4322 transitions. [2025-02-05 10:46:06,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-05 10:46:06,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:06,877 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:46:06,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:46:06,878 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:06,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:06,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1505989498, now seen corresponding path program 1 times [2025-02-05 10:46:06,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:06,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655606964] [2025-02-05 10:46:06,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:06,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:06,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 10:46:06,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 10:46:06,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:06,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 10:46:07,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:07,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655606964] [2025-02-05 10:46:07,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655606964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:07,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:46:07,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:46:07,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525982752] [2025-02-05 10:46:07,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:07,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:46:07,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:07,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:46:07,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:46:07,107 INFO L87 Difference]: Start difference. First operand 3300 states and 4322 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-02-05 10:46:07,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:07,823 INFO L93 Difference]: Finished difference Result 8022 states and 10769 transitions. [2025-02-05 10:46:07,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:07,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2025-02-05 10:46:07,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:07,836 INFO L225 Difference]: With dead ends: 8022 [2025-02-05 10:46:07,836 INFO L226 Difference]: Without dead ends: 4724 [2025-02-05 10:46:07,840 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-02-05 10:46:07,841 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 237 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:07,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 406 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:46:07,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4724 states. [2025-02-05 10:46:07,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4724 to 4722. [2025-02-05 10:46:07,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4722 states, 4721 states have (on average 1.267739885617454) internal successors, (5985), 4721 states have internal predecessors, (5985), 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-02-05 10:46:07,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4722 states to 4722 states and 5985 transitions. [2025-02-05 10:46:07,932 INFO L78 Accepts]: Start accepts. Automaton has 4722 states and 5985 transitions. Word has length 192 [2025-02-05 10:46:07,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:07,932 INFO L471 AbstractCegarLoop]: Abstraction has 4722 states and 5985 transitions. [2025-02-05 10:46:07,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-02-05 10:46:07,932 INFO L276 IsEmpty]: Start isEmpty. Operand 4722 states and 5985 transitions. [2025-02-05 10:46:07,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-05 10:46:07,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:07,937 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:46:07,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:46:07,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:07,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:07,938 INFO L85 PathProgramCache]: Analyzing trace with hash -26924978, now seen corresponding path program 1 times [2025-02-05 10:46:07,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:07,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382419651] [2025-02-05 10:46:07,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:07,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:07,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 10:46:07,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 10:46:07,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:07,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 10:46:08,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:08,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382419651] [2025-02-05 10:46:08,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382419651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:08,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:46:08,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:46:08,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264144170] [2025-02-05 10:46:08,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:08,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:46:08,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:08,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:46:08,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:46:08,043 INFO L87 Difference]: Start difference. First operand 4722 states and 5985 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 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-02-05 10:46:08,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:08,383 INFO L93 Difference]: Finished difference Result 9216 states and 11718 transitions. [2025-02-05 10:46:08,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:08,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 193 [2025-02-05 10:46:08,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:08,397 INFO L225 Difference]: With dead ends: 9216 [2025-02-05 10:46:08,397 INFO L226 Difference]: Without dead ends: 4496 [2025-02-05 10:46:08,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:46:08,404 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 326 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:08,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:46:08,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4496 states. [2025-02-05 10:46:08,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4496 to 4496. [2025-02-05 10:46:08,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4496 states, 4495 states have (on average 1.2298109010011125) internal successors, (5528), 4495 states have internal predecessors, (5528), 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-02-05 10:46:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4496 states to 4496 states and 5528 transitions. [2025-02-05 10:46:08,486 INFO L78 Accepts]: Start accepts. Automaton has 4496 states and 5528 transitions. Word has length 193 [2025-02-05 10:46:08,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:08,486 INFO L471 AbstractCegarLoop]: Abstraction has 4496 states and 5528 transitions. [2025-02-05 10:46:08,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 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-02-05 10:46:08,487 INFO L276 IsEmpty]: Start isEmpty. Operand 4496 states and 5528 transitions. [2025-02-05 10:46:08,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 10:46:08,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:08,492 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:46:08,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:46:08,492 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:08,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:08,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2084530192, now seen corresponding path program 1 times [2025-02-05 10:46:08,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:08,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201394733] [2025-02-05 10:46:08,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:08,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:08,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 10:46:08,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 10:46:08,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:08,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:08,628 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:46:08,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:08,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201394733] [2025-02-05 10:46:08,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201394733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:08,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:46:08,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:46:08,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624483358] [2025-02-05 10:46:08,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:08,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:46:08,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:08,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:46:08,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:46:08,629 INFO L87 Difference]: Start difference. First operand 4496 states and 5528 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 states have internal predecessors, (219), 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-02-05 10:46:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:09,259 INFO L93 Difference]: Finished difference Result 12854 states and 15739 transitions. [2025-02-05 10:46:09,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:09,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 219 [2025-02-05 10:46:09,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:09,283 INFO L225 Difference]: With dead ends: 12854 [2025-02-05 10:46:09,284 INFO L226 Difference]: Without dead ends: 8360 [2025-02-05 10:46:09,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:46:09,290 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 187 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:09,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 156 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:46:09,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8360 states. [2025-02-05 10:46:09,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8360 to 8358. [2025-02-05 10:46:09,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8358 states, 8357 states have (on average 1.192652865860955) internal successors, (9967), 8357 states have internal predecessors, (9967), 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-02-05 10:46:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8358 states to 8358 states and 9967 transitions. [2025-02-05 10:46:09,417 INFO L78 Accepts]: Start accepts. Automaton has 8358 states and 9967 transitions. Word has length 219 [2025-02-05 10:46:09,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:09,417 INFO L471 AbstractCegarLoop]: Abstraction has 8358 states and 9967 transitions. [2025-02-05 10:46:09,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 states have internal predecessors, (219), 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-02-05 10:46:09,417 INFO L276 IsEmpty]: Start isEmpty. Operand 8358 states and 9967 transitions. [2025-02-05 10:46:09,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-02-05 10:46:09,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:09,427 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-02-05 10:46:09,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:46:09,427 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:09,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:09,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1679153667, now seen corresponding path program 1 times [2025-02-05 10:46:09,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:09,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560706780] [2025-02-05 10:46:09,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:09,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:09,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-02-05 10:46:09,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-02-05 10:46:09,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:09,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:46:09,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:09,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560706780] [2025-02-05 10:46:09,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560706780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:09,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:46:09,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:46:09,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883832446] [2025-02-05 10:46:09,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:09,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:46:09,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:09,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:46:09,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:46:09,711 INFO L87 Difference]: Start difference. First operand 8358 states and 9967 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 2 states have internal predecessors, (241), 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-02-05 10:46:10,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:10,358 INFO L93 Difference]: Finished difference Result 20796 states and 24817 transitions. [2025-02-05 10:46:10,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:10,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 2 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 246 [2025-02-05 10:46:10,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:10,394 INFO L225 Difference]: With dead ends: 20796 [2025-02-05 10:46:10,394 INFO L226 Difference]: Without dead ends: 12440 [2025-02-05 10:46:10,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:46:10,403 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 159 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:10,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 153 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:46:10,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12440 states. [2025-02-05 10:46:10,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12440 to 12437. [2025-02-05 10:46:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12437 states, 12436 states have (on average 1.1925860405275008) internal successors, (14831), 12436 states have internal predecessors, (14831), 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-02-05 10:46:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12437 states to 12437 states and 14831 transitions. [2025-02-05 10:46:10,567 INFO L78 Accepts]: Start accepts. Automaton has 12437 states and 14831 transitions. Word has length 246 [2025-02-05 10:46:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:10,567 INFO L471 AbstractCegarLoop]: Abstraction has 12437 states and 14831 transitions. [2025-02-05 10:46:10,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 2 states have internal predecessors, (241), 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-02-05 10:46:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 12437 states and 14831 transitions. [2025-02-05 10:46:10,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-05 10:46:10,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:10,581 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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] [2025-02-05 10:46:10,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:46:10,582 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:10,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:10,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1780551160, now seen corresponding path program 1 times [2025-02-05 10:46:10,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:10,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885306345] [2025-02-05 10:46:10,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:10,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:10,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-05 10:46:10,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-05 10:46:10,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:10,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:11,516 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 92 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:46:11,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:11,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885306345] [2025-02-05 10:46:11,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885306345] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:46:11,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700222669] [2025-02-05 10:46:11,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:11,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:46:11,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:46:11,520 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-02-05 10:46:11,522 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-02-05 10:46:11,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-05 10:46:11,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-05 10:46:11,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:11,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:11,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:46:11,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:46:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-05 10:46:11,941 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:46:11,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700222669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:11,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:46:11,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-05 10:46:11,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160099221] [2025-02-05 10:46:11,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:11,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:46:11,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:11,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:46:11,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:46:11,943 INFO L87 Difference]: Start difference. First operand 12437 states and 14831 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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-02-05 10:46:12,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:12,566 INFO L93 Difference]: Finished difference Result 24878 states and 29672 transitions. [2025-02-05 10:46:12,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:12,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2025-02-05 10:46:12,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:12,591 INFO L225 Difference]: With dead ends: 24878 [2025-02-05 10:46:12,591 INFO L226 Difference]: Without dead ends: 12443 [2025-02-05 10:46:12,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 252 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-02-05 10:46:12,607 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 89 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:12,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 96 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:46:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12443 states. [2025-02-05 10:46:12,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12443 to 12437. [2025-02-05 10:46:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12437 states, 12436 states have (on average 1.1650048247024767) internal successors, (14488), 12436 states have internal predecessors, (14488), 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-02-05 10:46:12,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12437 states to 12437 states and 14488 transitions. [2025-02-05 10:46:12,792 INFO L78 Accepts]: Start accepts. Automaton has 12437 states and 14488 transitions. Word has length 253 [2025-02-05 10:46:12,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:12,792 INFO L471 AbstractCegarLoop]: Abstraction has 12437 states and 14488 transitions. [2025-02-05 10:46:12,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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-02-05 10:46:12,793 INFO L276 IsEmpty]: Start isEmpty. Operand 12437 states and 14488 transitions. [2025-02-05 10:46:12,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-02-05 10:46:12,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:12,808 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 10:46:12,815 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-02-05 10:46:13,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:46:13,009 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:13,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:13,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2093190593, now seen corresponding path program 1 times [2025-02-05 10:46:13,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:13,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518995255] [2025-02-05 10:46:13,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:13,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:13,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-02-05 10:46:13,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-02-05 10:46:13,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:13,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:46:13,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:13,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518995255] [2025-02-05 10:46:13,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518995255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:13,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:46:13,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:46:13,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131999074] [2025-02-05 10:46:13,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:13,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:46:13,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:13,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:46:13,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:46:13,232 INFO L87 Difference]: Start difference. First operand 12437 states and 14488 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 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-02-05 10:46:13,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:13,860 INFO L93 Difference]: Finished difference Result 24673 states and 28766 transitions. [2025-02-05 10:46:13,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:13,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261 [2025-02-05 10:46:13,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:13,878 INFO L225 Difference]: With dead ends: 24673 [2025-02-05 10:46:13,878 INFO L226 Difference]: Without dead ends: 12238 [2025-02-05 10:46:13,888 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-02-05 10:46:13,889 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 100 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:13,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 291 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:46:13,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12238 states. [2025-02-05 10:46:13,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12238 to 12234. [2025-02-05 10:46:14,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12234 states, 12233 states have (on average 1.1576882203874765) internal successors, (14162), 12233 states have internal predecessors, (14162), 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-02-05 10:46:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12234 states to 12234 states and 14162 transitions. [2025-02-05 10:46:14,014 INFO L78 Accepts]: Start accepts. Automaton has 12234 states and 14162 transitions. Word has length 261 [2025-02-05 10:46:14,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:14,015 INFO L471 AbstractCegarLoop]: Abstraction has 12234 states and 14162 transitions. [2025-02-05 10:46:14,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 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-02-05 10:46:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 12234 states and 14162 transitions. [2025-02-05 10:46:14,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-02-05 10:46:14,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:14,029 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 10:46:14,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 10:46:14,030 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:14,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:14,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2053775915, now seen corresponding path program 1 times [2025-02-05 10:46:14,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:14,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025318434] [2025-02-05 10:46:14,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:14,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:14,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-02-05 10:46:14,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-02-05 10:46:14,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:14,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:46:14,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:14,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025318434] [2025-02-05 10:46:14,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025318434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:14,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:46:14,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:46:14,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494790685] [2025-02-05 10:46:14,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:14,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:46:14,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:14,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:46:14,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:46:14,235 INFO L87 Difference]: Start difference. First operand 12234 states and 14162 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 2 states have internal predecessors, (280), 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-02-05 10:46:14,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:14,855 INFO L93 Difference]: Finished difference Result 32018 states and 37109 transitions. [2025-02-05 10:46:14,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:14,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 2 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 280 [2025-02-05 10:46:14,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:14,886 INFO L225 Difference]: With dead ends: 32018 [2025-02-05 10:46:14,886 INFO L226 Difference]: Without dead ends: 19786 [2025-02-05 10:46:14,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:46:14,901 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 121 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:14,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 92 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:46:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19786 states. [2025-02-05 10:46:15,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19786 to 19785. [2025-02-05 10:46:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19785 states, 19784 states have (on average 1.158158107561666) internal successors, (22913), 19784 states have internal predecessors, (22913), 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-02-05 10:46:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19785 states to 19785 states and 22913 transitions. [2025-02-05 10:46:15,172 INFO L78 Accepts]: Start accepts. Automaton has 19785 states and 22913 transitions. Word has length 280 [2025-02-05 10:46:15,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:15,172 INFO L471 AbstractCegarLoop]: Abstraction has 19785 states and 22913 transitions. [2025-02-05 10:46:15,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 2 states have internal predecessors, (280), 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-02-05 10:46:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 19785 states and 22913 transitions. [2025-02-05 10:46:15,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-02-05 10:46:15,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:15,197 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 10:46:15,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 10:46:15,197 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:15,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:15,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1311308016, now seen corresponding path program 1 times [2025-02-05 10:46:15,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:15,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544831794] [2025-02-05 10:46:15,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:15,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:15,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-02-05 10:46:15,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-02-05 10:46:15,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:15,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:15,435 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:46:15,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:15,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544831794] [2025-02-05 10:46:15,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544831794] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:15,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:46:15,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:46:15,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611659098] [2025-02-05 10:46:15,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:15,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:46:15,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:15,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:46:15,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:46:15,437 INFO L87 Difference]: Start difference. First operand 19785 states and 22913 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 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-02-05 10:46:16,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:16,178 INFO L93 Difference]: Finished difference Result 51207 states and 59296 transitions. [2025-02-05 10:46:16,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:46:16,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 287 [2025-02-05 10:46:16,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:16,219 INFO L225 Difference]: With dead ends: 51207 [2025-02-05 10:46:16,219 INFO L226 Difference]: Without dead ends: 31424 [2025-02-05 10:46:16,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:46:16,226 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 561 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:16,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 333 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:46:16,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31424 states. [2025-02-05 10:46:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31424 to 30991. [2025-02-05 10:46:16,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30991 states, 30990 states have (on average 1.151726363343014) internal successors, (35692), 30990 states have internal predecessors, (35692), 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-02-05 10:46:16,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30991 states to 30991 states and 35692 transitions. [2025-02-05 10:46:16,512 INFO L78 Accepts]: Start accepts. Automaton has 30991 states and 35692 transitions. Word has length 287 [2025-02-05 10:46:16,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:16,513 INFO L471 AbstractCegarLoop]: Abstraction has 30991 states and 35692 transitions. [2025-02-05 10:46:16,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 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-02-05 10:46:16,513 INFO L276 IsEmpty]: Start isEmpty. Operand 30991 states and 35692 transitions. [2025-02-05 10:46:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-02-05 10:46:16,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:16,534 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:46:16,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 10:46:16,534 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:16,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:16,535 INFO L85 PathProgramCache]: Analyzing trace with hash -343294595, now seen corresponding path program 1 times [2025-02-05 10:46:16,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:16,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004416875] [2025-02-05 10:46:16,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:16,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:16,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-02-05 10:46:16,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-02-05 10:46:16,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:16,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 156 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:46:16,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:16,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004416875] [2025-02-05 10:46:16,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004416875] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:46:16,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780785291] [2025-02-05 10:46:16,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:16,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:46:16,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:46:16,917 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-02-05 10:46:16,918 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-02-05 10:46:16,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-02-05 10:46:17,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-02-05 10:46:17,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:17,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:17,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:46:17,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:46:17,208 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-05 10:46:17,208 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:46:17,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780785291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:17,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:46:17,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-05 10:46:17,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150397704] [2025-02-05 10:46:17,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:17,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:46:17,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:17,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:46:17,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:46:17,209 INFO L87 Difference]: Start difference. First operand 30991 states and 35692 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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-02-05 10:46:17,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:17,794 INFO L93 Difference]: Finished difference Result 62398 states and 71916 transitions. [2025-02-05 10:46:17,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:17,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 322 [2025-02-05 10:46:17,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:17,833 INFO L225 Difference]: With dead ends: 62398 [2025-02-05 10:46:17,833 INFO L226 Difference]: Without dead ends: 31409 [2025-02-05 10:46:17,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:46:17,854 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 60 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:17,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 366 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:46:17,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31409 states. [2025-02-05 10:46:18,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31409 to 31397. [2025-02-05 10:46:18,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31397 states, 31396 states have (on average 1.149573194037457) internal successors, (36092), 31396 states have internal predecessors, (36092), 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-02-05 10:46:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31397 states to 31397 states and 36092 transitions. [2025-02-05 10:46:18,241 INFO L78 Accepts]: Start accepts. Automaton has 31397 states and 36092 transitions. Word has length 322 [2025-02-05 10:46:18,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:18,241 INFO L471 AbstractCegarLoop]: Abstraction has 31397 states and 36092 transitions. [2025-02-05 10:46:18,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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-02-05 10:46:18,241 INFO L276 IsEmpty]: Start isEmpty. Operand 31397 states and 36092 transitions. [2025-02-05 10:46:18,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-02-05 10:46:18,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:18,276 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:46:18,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 10:46:18,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:46:18,476 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:18,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:18,477 INFO L85 PathProgramCache]: Analyzing trace with hash -628300090, now seen corresponding path program 1 times [2025-02-05 10:46:18,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:18,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411912075] [2025-02-05 10:46:18,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:18,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:18,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-02-05 10:46:18,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-02-05 10:46:18,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:18,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-02-05 10:46:19,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:19,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411912075] [2025-02-05 10:46:19,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411912075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:19,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:46:19,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:46:19,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703063457] [2025-02-05 10:46:19,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:19,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:46:19,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:19,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:46:19,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:46:19,010 INFO L87 Difference]: Start difference. First operand 31397 states and 36092 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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-02-05 10:46:19,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:19,781 INFO L93 Difference]: Finished difference Result 66072 states and 76023 transitions. [2025-02-05 10:46:19,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:19,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 444 [2025-02-05 10:46:19,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:19,817 INFO L225 Difference]: With dead ends: 66072 [2025-02-05 10:46:19,818 INFO L226 Difference]: Without dead ends: 34677 [2025-02-05 10:46:19,825 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-02-05 10:46:19,825 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 187 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:19,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 332 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:46:19,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34677 states. [2025-02-05 10:46:20,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34677 to 34645. [2025-02-05 10:46:20,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34645 states, 34644 states have (on average 1.1397355963514606) internal successors, (39485), 34644 states have internal predecessors, (39485), 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-02-05 10:46:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34645 states to 34645 states and 39485 transitions. [2025-02-05 10:46:20,151 INFO L78 Accepts]: Start accepts. Automaton has 34645 states and 39485 transitions. Word has length 444 [2025-02-05 10:46:20,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:20,151 INFO L471 AbstractCegarLoop]: Abstraction has 34645 states and 39485 transitions. [2025-02-05 10:46:20,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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-02-05 10:46:20,151 INFO L276 IsEmpty]: Start isEmpty. Operand 34645 states and 39485 transitions. [2025-02-05 10:46:20,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2025-02-05 10:46:20,178 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:20,178 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:46:20,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 10:46:20,179 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:20,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:20,179 INFO L85 PathProgramCache]: Analyzing trace with hash -956859774, now seen corresponding path program 1 times [2025-02-05 10:46:20,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:20,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250134962] [2025-02-05 10:46:20,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:20,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:20,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 617 statements into 1 equivalence classes. [2025-02-05 10:46:20,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 617 of 617 statements. [2025-02-05 10:46:20,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:20,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:20,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 620 proven. 59 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2025-02-05 10:46:20,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:20,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250134962] [2025-02-05 10:46:20,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250134962] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:46:20,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076764830] [2025-02-05 10:46:20,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:20,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:46:20,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:46:20,865 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-02-05 10:46:20,866 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-02-05 10:46:20,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 617 statements into 1 equivalence classes. [2025-02-05 10:46:21,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 617 of 617 statements. [2025-02-05 10:46:21,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:21,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:21,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:46:21,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:46:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 777 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2025-02-05 10:46:21,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:46:21,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076764830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:21,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:46:21,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-05 10:46:21,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260048563] [2025-02-05 10:46:21,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:21,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:46:21,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:21,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:46:21,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:46:21,128 INFO L87 Difference]: Start difference. First operand 34645 states and 39485 transitions. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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-02-05 10:46:21,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:21,553 INFO L93 Difference]: Finished difference Result 93491 states and 106466 transitions. [2025-02-05 10:46:21,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:21,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 617 [2025-02-05 10:46:21,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:21,614 INFO L225 Difference]: With dead ends: 93491 [2025-02-05 10:46:21,615 INFO L226 Difference]: Without dead ends: 58848 [2025-02-05 10:46:21,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:46:21,627 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 242 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:21,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 784 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:46:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58848 states. [2025-02-05 10:46:22,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58848 to 54382. [2025-02-05 10:46:22,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54382 states, 54381 states have (on average 1.127581324359611) internal successors, (61319), 54381 states have internal predecessors, (61319), 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-02-05 10:46:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54382 states to 54382 states and 61319 transitions. [2025-02-05 10:46:22,164 INFO L78 Accepts]: Start accepts. Automaton has 54382 states and 61319 transitions. Word has length 617 [2025-02-05 10:46:22,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:22,164 INFO L471 AbstractCegarLoop]: Abstraction has 54382 states and 61319 transitions. [2025-02-05 10:46:22,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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-02-05 10:46:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 54382 states and 61319 transitions. [2025-02-05 10:46:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2025-02-05 10:46:22,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:22,208 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:46:22,215 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-02-05 10:46:22,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:46:22,408 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:22,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:22,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1809175944, now seen corresponding path program 1 times [2025-02-05 10:46:22,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:22,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149347718] [2025-02-05 10:46:22,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:22,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:22,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 621 statements into 1 equivalence classes. [2025-02-05 10:46:22,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 621 of 621 statements. [2025-02-05 10:46:22,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:22,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 628 proven. 59 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2025-02-05 10:46:23,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:23,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149347718] [2025-02-05 10:46:23,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149347718] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:46:23,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703340870] [2025-02-05 10:46:23,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:23,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:46:23,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:46:23,338 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-02-05 10:46:23,339 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-02-05 10:46:23,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 621 statements into 1 equivalence classes. [2025-02-05 10:46:23,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 621 of 621 statements. [2025-02-05 10:46:23,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:23,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:23,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:46:23,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:46:23,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 789 proven. 0 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2025-02-05 10:46:23,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:46:23,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703340870] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:23,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:46:23,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-05 10:46:23,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142373033] [2025-02-05 10:46:23,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:23,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:46:23,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:23,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:46:23,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:46:23,669 INFO L87 Difference]: Start difference. First operand 54382 states and 61319 transitions. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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-02-05 10:46:24,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:24,525 INFO L93 Difference]: Finished difference Result 141511 states and 159572 transitions. [2025-02-05 10:46:24,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:24,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 621 [2025-02-05 10:46:24,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:24,625 INFO L225 Difference]: With dead ends: 141511 [2025-02-05 10:46:24,626 INFO L226 Difference]: Without dead ends: 87131 [2025-02-05 10:46:24,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:46:24,670 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 229 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:24,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 156 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:46:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87131 states. [2025-02-05 10:46:25,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87131 to 87123. [2025-02-05 10:46:25,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87123 states, 87122 states have (on average 1.1139321870480476) internal successors, (97048), 87122 states have internal predecessors, (97048), 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-02-05 10:46:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87123 states to 87123 states and 97048 transitions. [2025-02-05 10:46:25,754 INFO L78 Accepts]: Start accepts. Automaton has 87123 states and 97048 transitions. Word has length 621 [2025-02-05 10:46:25,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:25,755 INFO L471 AbstractCegarLoop]: Abstraction has 87123 states and 97048 transitions. [2025-02-05 10:46:25,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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-02-05 10:46:25,755 INFO L276 IsEmpty]: Start isEmpty. Operand 87123 states and 97048 transitions. [2025-02-05 10:46:25,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2025-02-05 10:46:25,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:25,816 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:46:25,823 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-02-05 10:46:26,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 10:46:26,018 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:26,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:26,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1973976407, now seen corresponding path program 1 times [2025-02-05 10:46:26,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:26,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102659217] [2025-02-05 10:46:26,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:26,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:26,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 640 statements into 1 equivalence classes. [2025-02-05 10:46:26,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 640 of 640 statements. [2025-02-05 10:46:26,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:26,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:26,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1241 backedges. 651 proven. 59 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2025-02-05 10:46:26,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:26,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102659217] [2025-02-05 10:46:26,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102659217] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:46:26,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957359353] [2025-02-05 10:46:26,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:26,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:46:26,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:46:26,667 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-02-05 10:46:26,667 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-02-05 10:46:26,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 640 statements into 1 equivalence classes. [2025-02-05 10:46:26,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 640 of 640 statements. [2025-02-05 10:46:26,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:26,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:26,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:46:26,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:46:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1241 backedges. 818 proven. 0 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2025-02-05 10:46:26,987 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:46:26,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957359353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:26,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:46:26,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-05 10:46:26,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621183341] [2025-02-05 10:46:26,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:26,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:46:26,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:26,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:46:26,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:46:26,988 INFO L87 Difference]: Start difference. First operand 87123 states and 97048 transitions. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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-02-05 10:46:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:27,725 INFO L93 Difference]: Finished difference Result 238534 states and 266249 transitions. [2025-02-05 10:46:27,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:27,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 640 [2025-02-05 10:46:27,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:27,893 INFO L225 Difference]: With dead ends: 238534 [2025-02-05 10:46:27,893 INFO L226 Difference]: Without dead ends: 151413 [2025-02-05 10:46:27,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:46:27,953 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 183 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:27,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 841 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:46:28,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151413 states. [2025-02-05 10:46:29,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151413 to 150601. [2025-02-05 10:46:29,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150601 states, 150600 states have (on average 1.1065405046480743) internal successors, (166645), 150600 states have internal predecessors, (166645), 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-02-05 10:46:29,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150601 states to 150601 states and 166645 transitions. [2025-02-05 10:46:29,671 INFO L78 Accepts]: Start accepts. Automaton has 150601 states and 166645 transitions. Word has length 640 [2025-02-05 10:46:29,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:29,671 INFO L471 AbstractCegarLoop]: Abstraction has 150601 states and 166645 transitions. [2025-02-05 10:46:29,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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-02-05 10:46:29,671 INFO L276 IsEmpty]: Start isEmpty. Operand 150601 states and 166645 transitions. [2025-02-05 10:46:29,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-02-05 10:46:29,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:29,776 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:46:29,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 10:46:29,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 10:46:29,977 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:29,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:29,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1949955659, now seen corresponding path program 1 times [2025-02-05 10:46:29,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:29,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723268821] [2025-02-05 10:46:29,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:29,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:30,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-02-05 10:46:30,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-02-05 10:46:30,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:30,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1733 backedges. 800 proven. 59 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2025-02-05 10:46:31,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:31,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723268821] [2025-02-05 10:46:31,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723268821] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:46:31,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992615829] [2025-02-05 10:46:31,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:31,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:46:31,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:46:31,245 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-02-05 10:46:31,246 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-02-05 10:46:31,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-02-05 10:46:31,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-02-05 10:46:31,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:31,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:31,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:46:31,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:46:32,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1733 backedges. 568 proven. 438 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2025-02-05 10:46:32,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:46:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1733 backedges. 568 proven. 438 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2025-02-05 10:46:32,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992615829] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:46:32,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:46:32,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-05 10:46:32,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69303585] [2025-02-05 10:46:32,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:46:32,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:46:32,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:32,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:46:32,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:46:32,520 INFO L87 Difference]: Start difference. First operand 150601 states and 166645 transitions. Second operand has 6 states, 6 states have (on average 102.0) internal successors, (612), 5 states have internal predecessors, (612), 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-02-05 10:46:36,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:36,822 INFO L93 Difference]: Finished difference Result 603937 states and 665551 transitions. [2025-02-05 10:46:36,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 10:46:36,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 102.0) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 734 [2025-02-05 10:46:36,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:37,409 INFO L225 Difference]: With dead ends: 603937 [2025-02-05 10:46:37,410 INFO L226 Difference]: Without dead ends: 453330 [2025-02-05 10:46:37,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1480 GetRequests, 1465 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-02-05 10:46:37,973 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 2379 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 3337 mSolverCounterSat, 962 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2379 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 4299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 962 IncrementalHoareTripleChecker+Valid, 3337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:37,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2379 Valid, 505 Invalid, 4299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [962 Valid, 3337 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 10:46:38,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453330 states. [2025-02-05 10:46:43,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453330 to 450555. [2025-02-05 10:46:43,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450555 states, 450554 states have (on average 1.0786276450769496) internal successors, (485980), 450554 states have internal predecessors, (485980), 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-02-05 10:46:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450555 states to 450555 states and 485980 transitions. [2025-02-05 10:46:44,740 INFO L78 Accepts]: Start accepts. Automaton has 450555 states and 485980 transitions. Word has length 734 [2025-02-05 10:46:44,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:44,740 INFO L471 AbstractCegarLoop]: Abstraction has 450555 states and 485980 transitions. [2025-02-05 10:46:44,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.0) internal successors, (612), 5 states have internal predecessors, (612), 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-02-05 10:46:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 450555 states and 485980 transitions. [2025-02-05 10:46:45,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 813 [2025-02-05 10:46:45,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:45,447 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:46:45,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 10:46:45,648 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,SelfDestructingSolverStorable17 [2025-02-05 10:46:45,648 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:45,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:45,649 INFO L85 PathProgramCache]: Analyzing trace with hash -789618076, now seen corresponding path program 1 times [2025-02-05 10:46:45,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:45,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897700593] [2025-02-05 10:46:45,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:45,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:45,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 812 statements into 1 equivalence classes. [2025-02-05 10:46:45,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 812 of 812 statements. [2025-02-05 10:46:45,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:45,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:46,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2317 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 1679 trivial. 0 not checked. [2025-02-05 10:46:46,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:46,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897700593] [2025-02-05 10:46:46,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897700593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:46,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:46:46,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:46:46,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432391351] [2025-02-05 10:46:46,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:46,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:46:46,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:46,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:46:46,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:46:46,529 INFO L87 Difference]: Start difference. First operand 450555 states and 485980 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 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-02-05 10:46:49,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:49,663 INFO L93 Difference]: Finished difference Result 907480 states and 979571 transitions. [2025-02-05 10:46:49,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:49,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 812 [2025-02-05 10:46:49,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:50,375 INFO L225 Difference]: With dead ends: 907480 [2025-02-05 10:46:50,375 INFO L226 Difference]: Without dead ends: 456927 [2025-02-05 10:46:50,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:46:50,587 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 89 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:50,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 136 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:46:50,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456927 states. [2025-02-05 10:46:56,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456927 to 429432. [2025-02-05 10:46:56,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429432 states, 429431 states have (on average 1.069694549298956) internal successors, (459360), 429431 states have internal predecessors, (459360), 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-02-05 10:46:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429432 states to 429432 states and 459360 transitions. [2025-02-05 10:46:57,020 INFO L78 Accepts]: Start accepts. Automaton has 429432 states and 459360 transitions. Word has length 812 [2025-02-05 10:46:57,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:57,021 INFO L471 AbstractCegarLoop]: Abstraction has 429432 states and 459360 transitions. [2025-02-05 10:46:57,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 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-02-05 10:46:57,021 INFO L276 IsEmpty]: Start isEmpty. Operand 429432 states and 459360 transitions. [2025-02-05 10:46:57,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 858 [2025-02-05 10:46:57,898 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:57,898 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:46:57,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 10:46:57,899 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:57,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:57,899 INFO L85 PathProgramCache]: Analyzing trace with hash -154524735, now seen corresponding path program 1 times [2025-02-05 10:46:57,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:57,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677561439] [2025-02-05 10:46:57,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:57,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:58,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 857 statements into 1 equivalence classes. [2025-02-05 10:46:58,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 857 of 857 statements. [2025-02-05 10:46:58,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:58,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2723 backedges. 745 proven. 6 refuted. 0 times theorem prover too weak. 1972 trivial. 0 not checked. [2025-02-05 10:46:58,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:58,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677561439] [2025-02-05 10:46:58,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677561439] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:46:58,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176829339] [2025-02-05 10:46:58,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:58,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:46:58,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:46:58,974 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-02-05 10:46:58,975 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-02-05 10:46:59,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 857 statements into 1 equivalence classes. [2025-02-05 10:46:59,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 857 of 857 statements. [2025-02-05 10:46:59,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:59,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:59,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 1379 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:46:59,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:46:59,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2723 backedges. 751 proven. 0 refuted. 0 times theorem prover too weak. 1972 trivial. 0 not checked. [2025-02-05 10:46:59,531 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:46:59,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176829339] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:59,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:46:59,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-05 10:46:59,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306649248] [2025-02-05 10:46:59,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:59,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:46:59,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:59,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:46:59,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:46:59,532 INFO L87 Difference]: Start difference. First operand 429432 states and 459360 transitions. Second operand has 4 states, 4 states have (on average 77.25) internal successors, (309), 3 states have internal predecessors, (309), 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-02-05 10:47:02,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:02,588 INFO L93 Difference]: Finished difference Result 860630 states and 920781 transitions. [2025-02-05 10:47:02,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:47:02,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 77.25) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 857 [2025-02-05 10:47:02,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted.