./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label02.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 252caf568f55ccc117f08f171449ba48170f0a66dff72163b7ceb4914a3f7685 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:00:01,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:00:01,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:00:01,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:00:01,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:00:01,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:00:01,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:00:01,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:00:01,512 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:00:01,512 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:00:01,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:00:01,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:00:01,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:00:01,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:00:01,513 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:00:01,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:00:01,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:00:01,514 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:00:01,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:00:01,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:00:01,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:00:01,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:00:01,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:00:01,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:00:01,515 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:00:01,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:00:01,515 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:00:01,515 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:00:01,515 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:00:01,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:00:01,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:00:01,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:00:01,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:00:01,516 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:00:01,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:00:01,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:00:01,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:00:01,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:00:01,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:00:01,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:00:01,516 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:00:01,517 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:00:01,517 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:00:01,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:00:01,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:00:01,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:00:01,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:00:01,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:00:01,517 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 -> 252caf568f55ccc117f08f171449ba48170f0a66dff72163b7ceb4914a3f7685 [2025-01-09 00:00:01,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:00:01,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:00:01,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:00:01,812 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:00:01,812 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:00:01,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label02.c [2025-01-09 00:00:03,188 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0ec3c20b/8882634f57f146c097437349b9cf6338/FLAG754aa7e5b [2025-01-09 00:00:03,667 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:00:03,667 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label02.c [2025-01-09 00:00:03,691 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0ec3c20b/8882634f57f146c097437349b9cf6338/FLAG754aa7e5b [2025-01-09 00:00:03,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0ec3c20b/8882634f57f146c097437349b9cf6338 [2025-01-09 00:00:03,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:00:03,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:00:03,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:00:03,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:00:03,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:00:03,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:00:03" (1/1) ... [2025-01-09 00:00:03,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71a2e912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:03, skipping insertion in model container [2025-01-09 00:00:03,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:00:03" (1/1) ... [2025-01-09 00:00:03,836 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:00:03,999 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/Problem15_label02.c[3558,3571] [2025-01-09 00:00:04,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:00:04,409 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:00:04,425 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/Problem15_label02.c[3558,3571] [2025-01-09 00:00:04,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:00:04,666 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:00:04,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:04 WrapperNode [2025-01-09 00:00:04,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:00:04,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:00:04,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:00:04,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:00:04,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:04" (1/1) ... [2025-01-09 00:00:04,716 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:04" (1/1) ... [2025-01-09 00:00:04,876 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-01-09 00:00:04,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:00:04,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:00:04,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:00:04,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:00:04,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:04" (1/1) ... [2025-01-09 00:00:04,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:04" (1/1) ... [2025-01-09 00:00:04,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:04" (1/1) ... [2025-01-09 00:00:05,060 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 00:00:05,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:04" (1/1) ... [2025-01-09 00:00:05,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:04" (1/1) ... [2025-01-09 00:00:05,131 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:04" (1/1) ... [2025-01-09 00:00:05,143 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:04" (1/1) ... [2025-01-09 00:00:05,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:04" (1/1) ... [2025-01-09 00:00:05,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:04" (1/1) ... [2025-01-09 00:00:05,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:04" (1/1) ... [2025-01-09 00:00:05,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:00:05,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:00:05,286 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:00:05,286 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:00:05,288 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:04" (1/1) ... [2025-01-09 00:00:05,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:00:05,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:00:05,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:00:05,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:00:05,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:00:05,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:00:05,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:00:05,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:00:05,411 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:00:05,413 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:00:08,128 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-01-09 00:00:08,129 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:00:08,152 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:00:08,152 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:00:08,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:00:08 BoogieIcfgContainer [2025-01-09 00:00:08,153 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:00:08,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:00:08,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:00:08,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:00:08,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:00:03" (1/3) ... [2025-01-09 00:00:08,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfae8e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:00:08, skipping insertion in model container [2025-01-09 00:00:08,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:04" (2/3) ... [2025-01-09 00:00:08,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfae8e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:00:08, skipping insertion in model container [2025-01-09 00:00:08,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:00:08" (3/3) ... [2025-01-09 00:00:08,161 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label02.c [2025-01-09 00:00:08,175 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:00:08,177 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label02.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:00:08,249 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:00:08,259 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;@4a48ddca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:00:08,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:00:08,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 00:00:08,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:08,270 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] [2025-01-09 00:00:08,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:08,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:08,274 INFO L85 PathProgramCache]: Analyzing trace with hash -161316190, now seen corresponding path program 1 times [2025-01-09 00:00:08,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:08,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450442287] [2025-01-09 00:00:08,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:08,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:08,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 00:00:08,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 00:00:08,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:08,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:08,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:00:08,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:08,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450442287] [2025-01-09 00:00:08,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450442287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:08,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:08,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:00:08,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642780028] [2025-01-09 00:00:08,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:08,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:08,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:08,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:08,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:08,612 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 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 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:10,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:10,492 INFO L93 Difference]: Finished difference Result 1154 states and 2103 transitions. [2025-01-09 00:00:10,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:10,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-01-09 00:00:10,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:10,511 INFO L225 Difference]: With dead ends: 1154 [2025-01-09 00:00:10,511 INFO L226 Difference]: Without dead ends: 665 [2025-01-09 00:00:10,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:10,518 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 293 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:10,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 384 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:00:10,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-01-09 00:00:10,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2025-01-09 00:00:10,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:10,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions. [2025-01-09 00:00:10,594 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 28 [2025-01-09 00:00:10,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:10,594 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 981 transitions. [2025-01-09 00:00:10,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:10,595 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions. [2025-01-09 00:00:10,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 00:00:10,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:10,597 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:10,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:00:10,598 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:10,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:10,599 INFO L85 PathProgramCache]: Analyzing trace with hash 892287800, now seen corresponding path program 1 times [2025-01-09 00:00:10,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:10,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264173086] [2025-01-09 00:00:10,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:10,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:10,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 00:00:10,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 00:00:10,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:10,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:00:11,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:11,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264173086] [2025-01-09 00:00:11,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264173086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:11,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:11,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:00:11,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084872784] [2025-01-09 00:00:11,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:11,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:11,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:11,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:11,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:11,116 INFO L87 Difference]: Start difference. First operand 663 states and 981 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:12,471 INFO L93 Difference]: Finished difference Result 1624 states and 2315 transitions. [2025-01-09 00:00:12,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:12,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-01-09 00:00:12,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:12,481 INFO L225 Difference]: With dead ends: 1624 [2025-01-09 00:00:12,481 INFO L226 Difference]: Without dead ends: 963 [2025-01-09 00:00:12,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:12,489 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:12,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 337 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:00:12,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-01-09 00:00:12,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2025-01-09 00:00:12,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions. [2025-01-09 00:00:12,577 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 93 [2025-01-09 00:00:12,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:12,577 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions. [2025-01-09 00:00:12,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions. [2025-01-09 00:00:12,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 00:00:12,581 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:12,582 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:12,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:00:12,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:12,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:12,592 INFO L85 PathProgramCache]: Analyzing trace with hash -357361300, now seen corresponding path program 1 times [2025-01-09 00:00:12,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:12,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017395390] [2025-01-09 00:00:12,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:12,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:12,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 00:00:12,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 00:00:12,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:12,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:00:12,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:12,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017395390] [2025-01-09 00:00:12,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017395390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:12,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:12,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:00:12,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118837100] [2025-01-09 00:00:12,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:12,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:12,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:12,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:12,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:12,803 INFO L87 Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:14,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:14,291 INFO L93 Difference]: Finished difference Result 2229 states and 3186 transitions. [2025-01-09 00:00:14,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:14,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-01-09 00:00:14,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:14,298 INFO L225 Difference]: With dead ends: 2229 [2025-01-09 00:00:14,299 INFO L226 Difference]: Without dead ends: 1567 [2025-01-09 00:00:14,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:14,301 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 258 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:14,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 316 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:00:14,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2025-01-09 00:00:14,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1266. [2025-01-09 00:00:14,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3051383399209486) internal successors, (1651), 1265 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1651 transitions. [2025-01-09 00:00:14,331 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1651 transitions. Word has length 98 [2025-01-09 00:00:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:14,331 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1651 transitions. [2025-01-09 00:00:14,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1651 transitions. [2025-01-09 00:00:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 00:00:14,334 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:14,335 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:14,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:00:14,335 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:14,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:14,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1769986519, now seen corresponding path program 1 times [2025-01-09 00:00:14,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:14,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106499338] [2025-01-09 00:00:14,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:14,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:14,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 00:00:14,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 00:00:14,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:14,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:14,545 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:00:14,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:14,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106499338] [2025-01-09 00:00:14,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106499338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:14,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:14,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:00:14,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469393681] [2025-01-09 00:00:14,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:14,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:00:14,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:14,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:00:14,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:00:14,547 INFO L87 Difference]: Start difference. First operand 1266 states and 1651 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:17,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:17,833 INFO L93 Difference]: Finished difference Result 4668 states and 6173 transitions. [2025-01-09 00:00:17,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:00:17,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-01-09 00:00:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:17,849 INFO L225 Difference]: With dead ends: 4668 [2025-01-09 00:00:17,850 INFO L226 Difference]: Without dead ends: 3404 [2025-01-09 00:00:17,853 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-01-09 00:00:17,854 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 533 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:17,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 373 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-09 00:00:17,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2025-01-09 00:00:17,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3381. [2025-01-09 00:00:17,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.2366863905325445) internal successors, (4180), 3380 states have internal predecessors, (4180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:17,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4180 transitions. [2025-01-09 00:00:17,937 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4180 transitions. Word has length 119 [2025-01-09 00:00:17,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:17,938 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4180 transitions. [2025-01-09 00:00:17,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:17,938 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4180 transitions. [2025-01-09 00:00:17,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 00:00:17,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:17,945 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:00:17,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:00:17,946 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:17,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:17,946 INFO L85 PathProgramCache]: Analyzing trace with hash -263036456, now seen corresponding path program 1 times [2025-01-09 00:00:17,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:17,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815208225] [2025-01-09 00:00:17,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:17,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:17,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 00:00:18,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 00:00:18,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:18,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:18,182 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-09 00:00:18,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:18,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815208225] [2025-01-09 00:00:18,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815208225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:18,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:18,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:00:18,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593567021] [2025-01-09 00:00:18,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:18,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:18,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:18,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:18,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:18,186 INFO L87 Difference]: Start difference. First operand 3381 states and 4180 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:19,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:19,776 INFO L93 Difference]: Finished difference Result 8563 states and 10754 transitions. [2025-01-09 00:00:19,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:19,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 187 [2025-01-09 00:00:19,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:19,795 INFO L225 Difference]: With dead ends: 8563 [2025-01-09 00:00:19,795 INFO L226 Difference]: Without dead ends: 5483 [2025-01-09 00:00:19,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:19,802 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:19,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 337 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:00:19,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2025-01-09 00:00:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2025-01-09 00:00:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.16870549570933) internal successors, (6401), 5477 states have internal predecessors, (6401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6401 transitions. [2025-01-09 00:00:19,954 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6401 transitions. Word has length 187 [2025-01-09 00:00:19,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:19,954 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6401 transitions. [2025-01-09 00:00:19,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:19,955 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6401 transitions. [2025-01-09 00:00:19,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-01-09 00:00:19,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:19,959 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:19,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:00:19,959 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:19,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:19,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1062966120, now seen corresponding path program 1 times [2025-01-09 00:00:19,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:19,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353148091] [2025-01-09 00:00:19,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:19,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:19,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-01-09 00:00:20,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-01-09 00:00:20,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:20,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:20,701 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 00:00:20,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:20,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353148091] [2025-01-09 00:00:20,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353148091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:20,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:20,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:00:20,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370109532] [2025-01-09 00:00:20,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:20,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:20,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:20,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:20,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:20,708 INFO L87 Difference]: Start difference. First operand 5478 states and 6401 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:21,989 INFO L93 Difference]: Finished difference Result 10655 states and 12489 transitions. [2025-01-09 00:00:21,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:21,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 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 289 [2025-01-09 00:00:21,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:22,007 INFO L225 Difference]: With dead ends: 10655 [2025-01-09 00:00:22,008 INFO L226 Difference]: Without dead ends: 5478 [2025-01-09 00:00:22,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:22,018 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:22,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:00:22,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2025-01-09 00:00:22,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2025-01-09 00:00:22,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1676100054774512) internal successors, (6395), 5477 states have internal predecessors, (6395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6395 transitions. [2025-01-09 00:00:22,171 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6395 transitions. Word has length 289 [2025-01-09 00:00:22,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:22,171 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6395 transitions. [2025-01-09 00:00:22,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:22,172 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6395 transitions. [2025-01-09 00:00:22,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-01-09 00:00:22,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:22,178 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:00:22,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:00:22,178 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:22,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:22,183 INFO L85 PathProgramCache]: Analyzing trace with hash -312458119, now seen corresponding path program 1 times [2025-01-09 00:00:22,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:22,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416207457] [2025-01-09 00:00:22,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:22,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:22,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-01-09 00:00:22,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-01-09 00:00:22,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:22,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:22,511 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 00:00:22,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:22,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416207457] [2025-01-09 00:00:22,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416207457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:22,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:22,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:00:22,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028196694] [2025-01-09 00:00:22,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:22,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:22,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:22,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:22,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:22,519 INFO L87 Difference]: Start difference. First operand 5478 states and 6395 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:24,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:24,181 INFO L93 Difference]: Finished difference Result 11851 states and 14149 transitions. [2025-01-09 00:00:24,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:24,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 315 [2025-01-09 00:00:24,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:24,200 INFO L225 Difference]: With dead ends: 11851 [2025-01-09 00:00:24,200 INFO L226 Difference]: Without dead ends: 6674 [2025-01-09 00:00:24,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:24,208 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 287 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:24,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 323 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:00:24,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2025-01-09 00:00:24,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 4876. [2025-01-09 00:00:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4876 states, 4875 states have (on average 1.1755897435897436) internal successors, (5731), 4875 states have internal predecessors, (5731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 5731 transitions. [2025-01-09 00:00:24,332 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 5731 transitions. Word has length 315 [2025-01-09 00:00:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:24,333 INFO L471 AbstractCegarLoop]: Abstraction has 4876 states and 5731 transitions. [2025-01-09 00:00:24,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:24,333 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 5731 transitions. [2025-01-09 00:00:24,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-01-09 00:00:24,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:24,341 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:24,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:00:24,342 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:24,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:24,343 INFO L85 PathProgramCache]: Analyzing trace with hash -160019137, now seen corresponding path program 1 times [2025-01-09 00:00:24,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:24,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663867943] [2025-01-09 00:00:24,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:24,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:24,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-01-09 00:00:24,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-01-09 00:00:24,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:24,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-09 00:00:24,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:24,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663867943] [2025-01-09 00:00:24,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663867943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:24,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:24,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:00:24,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654731444] [2025-01-09 00:00:24,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:24,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:24,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:24,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:24,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:24,738 INFO L87 Difference]: Start difference. First operand 4876 states and 5731 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:26,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:26,162 INFO L93 Difference]: Finished difference Result 11553 states and 13859 transitions. [2025-01-09 00:00:26,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:26,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 374 [2025-01-09 00:00:26,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:26,182 INFO L225 Difference]: With dead ends: 11553 [2025-01-09 00:00:26,182 INFO L226 Difference]: Without dead ends: 6978 [2025-01-09 00:00:26,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:26,186 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 300 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:26,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 636 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:00:26,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6978 states. [2025-01-09 00:00:26,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6978 to 6380. [2025-01-09 00:00:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6380 states, 6379 states have (on average 1.1520614516381877) internal successors, (7349), 6379 states have internal predecessors, (7349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:26,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6380 states to 6380 states and 7349 transitions. [2025-01-09 00:00:26,278 INFO L78 Accepts]: Start accepts. Automaton has 6380 states and 7349 transitions. Word has length 374 [2025-01-09 00:00:26,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:26,280 INFO L471 AbstractCegarLoop]: Abstraction has 6380 states and 7349 transitions. [2025-01-09 00:00:26,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:26,281 INFO L276 IsEmpty]: Start isEmpty. Operand 6380 states and 7349 transitions. [2025-01-09 00:00:26,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-01-09 00:00:26,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:26,287 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:26,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:00:26,287 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:26,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:26,288 INFO L85 PathProgramCache]: Analyzing trace with hash -129700812, now seen corresponding path program 1 times [2025-01-09 00:00:26,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:26,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139303215] [2025-01-09 00:00:26,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:26,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:26,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 00:00:26,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 00:00:26,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:26,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 51 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:00:27,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:27,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139303215] [2025-01-09 00:00:27,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139303215] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:00:27,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840095519] [2025-01-09 00:00:27,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:27,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:27,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:00:27,381 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:00:27,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:00:27,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 00:00:27,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 00:00:27,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:27,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:27,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 00:00:27,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:00:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:00:28,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:00:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:00:30,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840095519] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:00:30,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:00:30,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 9 [2025-01-09 00:00:30,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340651488] [2025-01-09 00:00:30,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:30,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:00:30,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:30,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:00:30,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:00:30,015 INFO L87 Difference]: Start difference. First operand 6380 states and 7349 transitions. Second operand has 5 states, 5 states have (on average 75.0) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:33,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:33,190 INFO L93 Difference]: Finished difference Result 17278 states and 20288 transitions. [2025-01-09 00:00:33,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:00:33,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 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 375 [2025-01-09 00:00:33,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:33,208 INFO L225 Difference]: With dead ends: 17278 [2025-01-09 00:00:33,208 INFO L226 Difference]: Without dead ends: 11199 [2025-01-09 00:00:33,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 744 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:00:33,213 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 754 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 1277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 2632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1277 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:33,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 86 Invalid, 2632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1277 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 00:00:33,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11199 states. [2025-01-09 00:00:33,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11199 to 9976. [2025-01-09 00:00:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9976 states, 9975 states have (on average 1.1873684210526316) internal successors, (11844), 9975 states have internal predecessors, (11844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9976 states to 9976 states and 11844 transitions. [2025-01-09 00:00:33,331 INFO L78 Accepts]: Start accepts. Automaton has 9976 states and 11844 transitions. Word has length 375 [2025-01-09 00:00:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:33,331 INFO L471 AbstractCegarLoop]: Abstraction has 9976 states and 11844 transitions. [2025-01-09 00:00:33,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:33,332 INFO L276 IsEmpty]: Start isEmpty. Operand 9976 states and 11844 transitions. [2025-01-09 00:00:33,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-01-09 00:00:33,338 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:33,338 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:33,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:00:33,542 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-01-09 00:00:33,543 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:33,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:33,543 INFO L85 PathProgramCache]: Analyzing trace with hash 157634021, now seen corresponding path program 1 times [2025-01-09 00:00:33,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:33,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878746340] [2025-01-09 00:00:33,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:33,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:33,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-01-09 00:00:33,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-01-09 00:00:33,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:33,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:34,007 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:00:34,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:34,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878746340] [2025-01-09 00:00:34,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878746340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:34,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:34,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:00:34,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128803613] [2025-01-09 00:00:34,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:34,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:34,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:34,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:34,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:34,016 INFO L87 Difference]: Start difference. First operand 9976 states and 11844 transitions. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:35,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:35,462 INFO L93 Difference]: Finished difference Result 22948 states and 27821 transitions. [2025-01-09 00:00:35,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:35,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 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 391 [2025-01-09 00:00:35,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:35,495 INFO L225 Difference]: With dead ends: 22948 [2025-01-09 00:00:35,496 INFO L226 Difference]: Without dead ends: 13273 [2025-01-09 00:00:35,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:35,510 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 246 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:35,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 601 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:00:35,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13273 states. [2025-01-09 00:00:35,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13273 to 12373. [2025-01-09 00:00:35,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12373 states, 12372 states have (on average 1.1720012932428063) internal successors, (14500), 12372 states have internal predecessors, (14500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12373 states to 12373 states and 14500 transitions. [2025-01-09 00:00:35,723 INFO L78 Accepts]: Start accepts. Automaton has 12373 states and 14500 transitions. Word has length 391 [2025-01-09 00:00:35,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:35,725 INFO L471 AbstractCegarLoop]: Abstraction has 12373 states and 14500 transitions. [2025-01-09 00:00:35,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:35,725 INFO L276 IsEmpty]: Start isEmpty. Operand 12373 states and 14500 transitions. [2025-01-09 00:00:35,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-01-09 00:00:35,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:35,731 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:35,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:00:35,732 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:35,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:35,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1152671352, now seen corresponding path program 1 times [2025-01-09 00:00:35,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:35,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389692765] [2025-01-09 00:00:35,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:35,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:35,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-01-09 00:00:35,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-01-09 00:00:35,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:35,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:36,112 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 00:00:36,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:36,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389692765] [2025-01-09 00:00:36,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389692765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:36,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:36,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:00:36,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063198602] [2025-01-09 00:00:36,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:36,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:36,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:36,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:36,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:36,114 INFO L87 Difference]: Start difference. First operand 12373 states and 14500 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:37,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:37,473 INFO L93 Difference]: Finished difference Result 27734 states and 33141 transitions. [2025-01-09 00:00:37,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:37,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 405 [2025-01-09 00:00:37,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:37,502 INFO L225 Difference]: With dead ends: 27734 [2025-01-09 00:00:37,502 INFO L226 Difference]: Without dead ends: 15662 [2025-01-09 00:00:37,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:37,519 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 300 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:37,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 615 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:00:37,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15662 states. [2025-01-09 00:00:37,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15662 to 15359. [2025-01-09 00:00:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15359 states, 15358 states have (on average 1.155488995963016) internal successors, (17746), 15358 states have internal predecessors, (17746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:37,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15359 states to 15359 states and 17746 transitions. [2025-01-09 00:00:37,775 INFO L78 Accepts]: Start accepts. Automaton has 15359 states and 17746 transitions. Word has length 405 [2025-01-09 00:00:37,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:37,776 INFO L471 AbstractCegarLoop]: Abstraction has 15359 states and 17746 transitions. [2025-01-09 00:00:37,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:37,777 INFO L276 IsEmpty]: Start isEmpty. Operand 15359 states and 17746 transitions. [2025-01-09 00:00:37,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-01-09 00:00:37,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:37,783 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:37,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:00:37,783 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:37,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:37,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1826123075, now seen corresponding path program 1 times [2025-01-09 00:00:37,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:37,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702974572] [2025-01-09 00:00:37,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:37,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:37,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-01-09 00:00:37,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-01-09 00:00:37,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:37,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 26 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:00:38,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:38,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702974572] [2025-01-09 00:00:38,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702974572] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:00:38,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944605027] [2025-01-09 00:00:38,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:38,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:38,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:00:38,650 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:00:38,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 00:00:38,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-01-09 00:00:38,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-01-09 00:00:38,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:38,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:38,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:00:38,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:00:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 204 proven. 106 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 00:00:39,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:00:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 204 proven. 106 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 00:00:42,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944605027] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:00:42,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:00:42,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2025-01-09 00:00:42,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521453894] [2025-01-09 00:00:42,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:00:42,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 00:00:42,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:42,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 00:00:42,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:00:42,316 INFO L87 Difference]: Start difference. First operand 15359 states and 17746 transitions. Second operand has 9 states, 9 states have (on average 116.22222222222223) internal successors, (1046), 8 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:51,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:51,026 INFO L93 Difference]: Finished difference Result 70617 states and 80380 transitions. [2025-01-09 00:00:51,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 00:00:51,027 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 116.22222222222223) internal successors, (1046), 8 states have internal predecessors, (1046), 0 states have call successors, (0), 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 482 [2025-01-09 00:00:51,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:51,140 INFO L225 Difference]: With dead ends: 70617 [2025-01-09 00:00:51,140 INFO L226 Difference]: Without dead ends: 55559 [2025-01-09 00:00:51,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 981 GetRequests, 960 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2025-01-09 00:00:51,163 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 5885 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 6457 mSolverCounterSat, 3567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5885 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 10024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3567 IncrementalHoareTripleChecker+Valid, 6457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:51,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5885 Valid, 219 Invalid, 10024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3567 Valid, 6457 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2025-01-09 00:00:51,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55559 states. [2025-01-09 00:00:51,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55559 to 40508. [2025-01-09 00:00:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40508 states, 40507 states have (on average 1.1425185770360677) internal successors, (46280), 40507 states have internal predecessors, (46280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:51,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40508 states to 40508 states and 46280 transitions. [2025-01-09 00:00:51,820 INFO L78 Accepts]: Start accepts. Automaton has 40508 states and 46280 transitions. Word has length 482 [2025-01-09 00:00:51,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:51,820 INFO L471 AbstractCegarLoop]: Abstraction has 40508 states and 46280 transitions. [2025-01-09 00:00:51,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.22222222222223) internal successors, (1046), 8 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:51,821 INFO L276 IsEmpty]: Start isEmpty. Operand 40508 states and 46280 transitions. [2025-01-09 00:00:51,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-01-09 00:00:51,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:51,826 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:51,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 00:00:52,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:52,027 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:52,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:52,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1901805357, now seen corresponding path program 1 times [2025-01-09 00:00:52,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:52,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756926654] [2025-01-09 00:00:52,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:52,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:52,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-01-09 00:00:52,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-01-09 00:00:52,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:52,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 312 proven. 39 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 00:00:52,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:52,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756926654] [2025-01-09 00:00:52,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756926654] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:00:52,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232600352] [2025-01-09 00:00:52,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:52,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:52,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:00:52,565 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:00:52,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 00:00:52,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-01-09 00:00:52,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-01-09 00:00:52,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:52,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:52,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 00:00:52,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:00:53,365 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 312 proven. 39 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 00:00:53,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:00:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 312 proven. 39 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 00:00:53,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232600352] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:00:53,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:00:53,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-09 00:00:53,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255838179] [2025-01-09 00:00:53,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:00:53,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 00:00:53,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:53,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 00:00:53,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:00:53,888 INFO L87 Difference]: Start difference. First operand 40508 states and 46280 transitions. Second operand has 9 states, 9 states have (on average 83.44444444444444) internal successors, (751), 8 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:58,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:58,863 INFO L93 Difference]: Finished difference Result 84468 states and 95951 transitions. [2025-01-09 00:00:58,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 00:00:58,864 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 83.44444444444444) internal successors, (751), 8 states have internal predecessors, (751), 0 states have call successors, (0), 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 488 [2025-01-09 00:00:58,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:58,923 INFO L225 Difference]: With dead ends: 84468 [2025-01-09 00:00:58,923 INFO L226 Difference]: Without dead ends: 30936 [2025-01-09 00:00:58,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 985 GetRequests, 971 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-01-09 00:00:58,953 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 2739 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 6122 mSolverCounterSat, 732 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2739 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 6854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 732 IncrementalHoareTripleChecker+Valid, 6122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:58,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2739 Valid, 280 Invalid, 6854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [732 Valid, 6122 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-01-09 00:00:58,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30936 states. [2025-01-09 00:00:59,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30936 to 21343. [2025-01-09 00:00:59,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21343 states, 21342 states have (on average 1.073751288539031) internal successors, (22916), 21342 states have internal predecessors, (22916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:59,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21343 states to 21343 states and 22916 transitions. [2025-01-09 00:00:59,276 INFO L78 Accepts]: Start accepts. Automaton has 21343 states and 22916 transitions. Word has length 488 [2025-01-09 00:00:59,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:59,276 INFO L471 AbstractCegarLoop]: Abstraction has 21343 states and 22916 transitions. [2025-01-09 00:00:59,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.44444444444444) internal successors, (751), 8 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 21343 states and 22916 transitions. [2025-01-09 00:00:59,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-09 00:00:59,281 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:59,281 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:59,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 00:00:59,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:59,482 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:59,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:59,483 INFO L85 PathProgramCache]: Analyzing trace with hash 538192959, now seen corresponding path program 1 times [2025-01-09 00:00:59,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:59,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63580637] [2025-01-09 00:00:59,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:59,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:59,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 00:00:59,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 00:00:59,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:59,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:00,307 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 77 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:00,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:00,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63580637] [2025-01-09 00:01:00,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63580637] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:00,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167445774] [2025-01-09 00:01:00,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:00,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:00,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:00,312 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:01:00,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 00:01:00,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 00:01:00,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 00:01:00,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:00,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:00,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 00:01:00,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 26 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:00,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:01:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:01,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167445774] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:01,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:01:01,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 12 [2025-01-09 00:01:01,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368202406] [2025-01-09 00:01:01,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:01,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 00:01:01,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:01,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 00:01:01,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=83, Unknown=0, NotChecked=0, Total=156 [2025-01-09 00:01:01,827 INFO L87 Difference]: Start difference. First operand 21343 states and 22916 transitions. Second operand has 6 states, 6 states have (on average 82.33333333333333) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:03,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:03,454 INFO L93 Difference]: Finished difference Result 45393 states and 48670 transitions. [2025-01-09 00:01:03,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:01:03,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 82.33333333333333) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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 494 [2025-01-09 00:01:03,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:03,486 INFO L225 Difference]: With dead ends: 45393 [2025-01-09 00:01:03,486 INFO L226 Difference]: Without dead ends: 24052 [2025-01-09 00:01:03,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 991 GetRequests, 979 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=83, Unknown=0, NotChecked=0, Total=156 [2025-01-09 00:01:03,507 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 864 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1762 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 2152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 1762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:03,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 85 Invalid, 2152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 1762 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:01:03,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24052 states. [2025-01-09 00:01:03,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24052 to 21044. [2025-01-09 00:01:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21044 states, 21043 states have (on average 1.0743240032314785) internal successors, (22607), 21043 states have internal predecessors, (22607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:03,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21044 states to 21044 states and 22607 transitions. [2025-01-09 00:01:03,846 INFO L78 Accepts]: Start accepts. Automaton has 21044 states and 22607 transitions. Word has length 494 [2025-01-09 00:01:03,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:03,847 INFO L471 AbstractCegarLoop]: Abstraction has 21044 states and 22607 transitions. [2025-01-09 00:01:03,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.33333333333333) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:03,847 INFO L276 IsEmpty]: Start isEmpty. Operand 21044 states and 22607 transitions. [2025-01-09 00:01:03,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2025-01-09 00:01:03,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:03,854 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:03,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 00:01:04,054 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,SelfDestructingSolverStorable13 [2025-01-09 00:01:04,054 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:04,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:04,055 INFO L85 PathProgramCache]: Analyzing trace with hash 353728061, now seen corresponding path program 1 times [2025-01-09 00:01:04,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:04,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755043294] [2025-01-09 00:01:04,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:04,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:04,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 582 statements into 1 equivalence classes. [2025-01-09 00:01:04,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-01-09 00:01:04,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:04,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 78 proven. 292 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-01-09 00:01:05,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:05,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755043294] [2025-01-09 00:01:05,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755043294] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:05,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313791800] [2025-01-09 00:01:05,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:05,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:05,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:05,075 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:01:05,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 00:01:05,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 582 statements into 1 equivalence classes. [2025-01-09 00:01:05,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-01-09 00:01:05,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:05,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:05,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:01:05,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:05,329 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-01-09 00:01:05,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:01:05,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313791800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:05,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:01:05,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 00:01:05,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609485111] [2025-01-09 00:01:05,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:05,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:05,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:05,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:05,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:01:05,332 INFO L87 Difference]: Start difference. First operand 21044 states and 22607 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:06,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:06,385 INFO L93 Difference]: Finished difference Result 41784 states and 44894 transitions. [2025-01-09 00:01:06,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:06,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 582 [2025-01-09 00:01:06,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:06,408 INFO L225 Difference]: With dead ends: 41784 [2025-01-09 00:01:06,408 INFO L226 Difference]: Without dead ends: 20742 [2025-01-09 00:01:06,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 583 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:01:06,425 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 302 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:06,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 518 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:01:06,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20742 states. [2025-01-09 00:01:06,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20742 to 20740. [2025-01-09 00:01:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20740 states, 20739 states have (on average 1.0436375910121027) internal successors, (21644), 20739 states have internal predecessors, (21644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:06,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20740 states to 20740 states and 21644 transitions. [2025-01-09 00:01:06,610 INFO L78 Accepts]: Start accepts. Automaton has 20740 states and 21644 transitions. Word has length 582 [2025-01-09 00:01:06,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:06,610 INFO L471 AbstractCegarLoop]: Abstraction has 20740 states and 21644 transitions. [2025-01-09 00:01:06,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 20740 states and 21644 transitions. [2025-01-09 00:01:06,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-01-09 00:01:06,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:06,619 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:01:06,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 00:01:06,819 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,SelfDestructingSolverStorable14 [2025-01-09 00:01:06,820 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:06,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:06,820 INFO L85 PathProgramCache]: Analyzing trace with hash 683292088, now seen corresponding path program 1 times [2025-01-09 00:01:06,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:06,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366231300] [2025-01-09 00:01:06,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:06,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:06,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-01-09 00:01:06,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-01-09 00:01:06,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:06,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:07,394 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2025-01-09 00:01:07,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:07,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366231300] [2025-01-09 00:01:07,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366231300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:07,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:07,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:07,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85909889] [2025-01-09 00:01:07,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:07,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:01:07,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:07,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:01:07,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:01:07,396 INFO L87 Difference]: Start difference. First operand 20740 states and 21644 transitions. Second operand has 4 states, 4 states have (on average 75.75) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:08,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:08,744 INFO L93 Difference]: Finished difference Result 60101 states and 62753 transitions. [2025-01-09 00:01:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:01:08,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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 667 [2025-01-09 00:01:08,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:08,786 INFO L225 Difference]: With dead ends: 60101 [2025-01-09 00:01:08,786 INFO L226 Difference]: Without dead ends: 39662 [2025-01-09 00:01:08,803 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-01-09 00:01:08,804 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 521 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:08,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 166 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1537 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:01:08,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39662 states. [2025-01-09 00:01:09,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39662 to 35463. [2025-01-09 00:01:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35463 states, 35462 states have (on average 1.0431729738875415) internal successors, (36993), 35462 states have internal predecessors, (36993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:09,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35463 states to 35463 states and 36993 transitions. [2025-01-09 00:01:09,177 INFO L78 Accepts]: Start accepts. Automaton has 35463 states and 36993 transitions. Word has length 667 [2025-01-09 00:01:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:09,178 INFO L471 AbstractCegarLoop]: Abstraction has 35463 states and 36993 transitions. [2025-01-09 00:01:09,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 35463 states and 36993 transitions. [2025-01-09 00:01:09,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2025-01-09 00:01:09,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:09,184 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:01:09,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:01:09,185 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:09,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:09,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1303426885, now seen corresponding path program 1 times [2025-01-09 00:01:09,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:09,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512225645] [2025-01-09 00:01:09,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:09,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:09,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-01-09 00:01:09,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-01-09 00:01:09,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:09,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 77 proven. 464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:10,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:10,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512225645] [2025-01-09 00:01:10,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512225645] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:10,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128156364] [2025-01-09 00:01:10,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:10,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:10,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:10,346 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:01:10,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 00:01:10,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-01-09 00:01:10,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-01-09 00:01:10,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:10,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:10,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 00:01:10,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:11,314 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 26 proven. 515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:11,315 INFO L312 TraceCheckSpWp]: Computing backward predicates...