./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-49.i --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/hardness-nfm22/hardness_operatoramount_amount500_file-49.i -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 4a71ff94ddd05990b8bae34b7e5a74219661739e8f61363c2e62cfc27979e9a4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:47:26,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:47:27,062 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:47:27,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:47:27,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:47:27,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:47:27,088 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:47:27,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:47:27,089 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:47:27,089 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:47:27,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:47:27,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:47:27,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:47:27,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:47:27,089 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:47:27,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:47:27,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:47:27,090 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:47:27,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:47:27,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:47:27,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:47:27,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:47:27,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:47:27,090 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:47:27,090 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:47:27,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:47:27,090 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:47:27,091 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:47:27,091 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:47:27,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:47:27,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:47:27,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:47:27,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:27,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:47:27,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:47:27,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:47:27,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:47:27,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:27,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:47:27,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:47:27,092 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:47:27,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:47:27,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:47:27,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:47:27,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:47:27,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:47:27,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:47:27,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:47:27,092 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 -> 4a71ff94ddd05990b8bae34b7e5a74219661739e8f61363c2e62cfc27979e9a4 [2025-01-09 14:47:27,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:47:27,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:47:27,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:47:27,354 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:47:27,354 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:47:27,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-49.i [2025-01-09 14:47:28,607 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a4748996/fbdec9c6a7344c1a873a7d0e3eba6533/FLAG7762b8c3a [2025-01-09 14:47:28,955 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:47:28,959 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-49.i [2025-01-09 14:47:28,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a4748996/fbdec9c6a7344c1a873a7d0e3eba6533/FLAG7762b8c3a [2025-01-09 14:47:29,187 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a4748996/fbdec9c6a7344c1a873a7d0e3eba6533 [2025-01-09 14:47:29,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:47:29,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:47:29,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:47:29,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:47:29,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:47:29,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:29" (1/1) ... [2025-01-09 14:47:29,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608424ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:29, skipping insertion in model container [2025-01-09 14:47:29,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:29" (1/1) ... [2025-01-09 14:47:29,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:47:29,357 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/hardness-nfm22/hardness_operatoramount_amount500_file-49.i[916,929] [2025-01-09 14:47:29,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:47:29,504 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:47:29,511 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/hardness-nfm22/hardness_operatoramount_amount500_file-49.i[916,929] [2025-01-09 14:47:29,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:47:29,589 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:47:29,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:29 WrapperNode [2025-01-09 14:47:29,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:47:29,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:47:29,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:47:29,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:47:29,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:29" (1/1) ... [2025-01-09 14:47:29,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:29" (1/1) ... [2025-01-09 14:47:29,726 INFO L138 Inliner]: procedures = 26, calls = 104, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 781 [2025-01-09 14:47:29,726 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:47:29,727 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:47:29,727 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:47:29,727 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:47:29,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:29" (1/1) ... [2025-01-09 14:47:29,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:29" (1/1) ... [2025-01-09 14:47:29,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:29" (1/1) ... [2025-01-09 14:47:29,855 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 14:47:29,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:29" (1/1) ... [2025-01-09 14:47:29,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:29" (1/1) ... [2025-01-09 14:47:29,893 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:29" (1/1) ... [2025-01-09 14:47:29,901 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:29" (1/1) ... [2025-01-09 14:47:29,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:29" (1/1) ... [2025-01-09 14:47:29,922 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:29" (1/1) ... [2025-01-09 14:47:29,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:29" (1/1) ... [2025-01-09 14:47:29,944 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:47:29,946 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:47:29,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:47:29,947 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:47:29,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:29" (1/1) ... [2025-01-09 14:47:29,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:29,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:29,979 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 14:47:29,987 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 14:47:30,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:47:30,001 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:47:30,001 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:47:30,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:47:30,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:47:30,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:47:30,141 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:47:30,142 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:47:31,174 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2025-01-09 14:47:31,175 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:47:31,190 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:47:31,191 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:47:31,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:31 BoogieIcfgContainer [2025-01-09 14:47:31,191 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:47:31,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:47:31,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:47:31,199 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:47:31,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:47:29" (1/3) ... [2025-01-09 14:47:31,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8165304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:31, skipping insertion in model container [2025-01-09 14:47:31,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:29" (2/3) ... [2025-01-09 14:47:31,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8165304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:31, skipping insertion in model container [2025-01-09 14:47:31,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:31" (3/3) ... [2025-01-09 14:47:31,202 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-49.i [2025-01-09 14:47:31,213 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:47:31,217 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-49.i that has 2 procedures, 311 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:47:31,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:47:31,285 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;@3927ce1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:47:31,285 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:47:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand has 311 states, 217 states have (on average 1.5115207373271888) internal successors, (328), 218 states have internal predecessors, (328), 91 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2025-01-09 14:47:31,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-01-09 14:47:31,328 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:31,329 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:31,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:31,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:31,335 INFO L85 PathProgramCache]: Analyzing trace with hash 560964719, now seen corresponding path program 1 times [2025-01-09 14:47:31,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:31,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874402227] [2025-01-09 14:47:31,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:31,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:31,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-01-09 14:47:31,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-01-09 14:47:31,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:31,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 16200 trivial. 0 not checked. [2025-01-09 14:47:31,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:31,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874402227] [2025-01-09 14:47:31,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874402227] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:31,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222182667] [2025-01-09 14:47:31,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:31,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:31,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:31,963 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 14:47:31,964 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 14:47:32,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-01-09 14:47:32,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-01-09 14:47:32,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:32,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:32,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:47:32,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:32,362 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 16200 trivial. 0 not checked. [2025-01-09 14:47:32,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:47:32,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222182667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:32,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:47:32,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:47:32,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493247973] [2025-01-09 14:47:32,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:32,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:47:32,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:32,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:47:32,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:47:32,383 INFO L87 Difference]: Start difference. First operand has 311 states, 217 states have (on average 1.5115207373271888) internal successors, (328), 218 states have internal predecessors, (328), 91 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) Second operand has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (91), 2 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 2 states have call successors, (91) [2025-01-09 14:47:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:32,422 INFO L93 Difference]: Finished difference Result 611 states and 1098 transitions. [2025-01-09 14:47:32,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:47:32,424 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (91), 2 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 2 states have call successors, (91) Word has length 596 [2025-01-09 14:47:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:32,430 INFO L225 Difference]: With dead ends: 611 [2025-01-09 14:47:32,430 INFO L226 Difference]: Without dead ends: 303 [2025-01-09 14:47:32,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 597 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:47:32,435 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:32,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:32,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-01-09 14:47:32,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2025-01-09 14:47:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 210 states have (on average 1.4857142857142858) internal successors, (312), 210 states have internal predecessors, (312), 91 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2025-01-09 14:47:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 494 transitions. [2025-01-09 14:47:32,485 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 494 transitions. Word has length 596 [2025-01-09 14:47:32,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:32,485 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 494 transitions. [2025-01-09 14:47:32,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (91), 2 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 2 states have call successors, (91) [2025-01-09 14:47:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 494 transitions. [2025-01-09 14:47:32,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-01-09 14:47:32,493 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:32,493 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:32,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:47:32,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:47:32,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:32,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:32,699 INFO L85 PathProgramCache]: Analyzing trace with hash 832937965, now seen corresponding path program 1 times [2025-01-09 14:47:32,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:32,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671468937] [2025-01-09 14:47:32,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:32,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:32,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-01-09 14:47:32,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-01-09 14:47:32,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:32,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-01-09 14:47:33,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:33,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671468937] [2025-01-09 14:47:33,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671468937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:33,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:33,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:33,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245993231] [2025-01-09 14:47:33,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:33,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:33,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:33,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:33,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:33,267 INFO L87 Difference]: Start difference. First operand 303 states and 494 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 14:47:33,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:33,387 INFO L93 Difference]: Finished difference Result 902 states and 1474 transitions. [2025-01-09 14:47:33,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:33,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 596 [2025-01-09 14:47:33,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:33,401 INFO L225 Difference]: With dead ends: 902 [2025-01-09 14:47:33,403 INFO L226 Difference]: Without dead ends: 602 [2025-01-09 14:47:33,405 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 14:47:33,406 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 479 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:33,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 961 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:33,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-01-09 14:47:33,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2025-01-09 14:47:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 415 states have (on average 1.4771084337349398) internal successors, (613), 415 states have internal predecessors, (613), 182 states have call successors, (182), 2 states have call predecessors, (182), 2 states have return successors, (182), 182 states have call predecessors, (182), 182 states have call successors, (182) [2025-01-09 14:47:33,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 977 transitions. [2025-01-09 14:47:33,538 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 977 transitions. Word has length 596 [2025-01-09 14:47:33,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:33,542 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 977 transitions. [2025-01-09 14:47:33,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 14:47:33,543 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 977 transitions. [2025-01-09 14:47:33,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-01-09 14:47:33,553 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:33,553 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:33,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:47:33,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:33,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:33,556 INFO L85 PathProgramCache]: Analyzing trace with hash -553265429, now seen corresponding path program 1 times [2025-01-09 14:47:33,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:33,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515579472] [2025-01-09 14:47:33,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:33,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:33,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-01-09 14:47:33,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-01-09 14:47:33,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:33,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:34,127 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-01-09 14:47:34,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:34,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515579472] [2025-01-09 14:47:34,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515579472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:34,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:34,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:34,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084381813] [2025-01-09 14:47:34,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:34,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:34,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:34,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:34,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:34,129 INFO L87 Difference]: Start difference. First operand 600 states and 977 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 14:47:34,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:34,252 INFO L93 Difference]: Finished difference Result 1778 states and 2897 transitions. [2025-01-09 14:47:34,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:34,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 596 [2025-01-09 14:47:34,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:34,261 INFO L225 Difference]: With dead ends: 1778 [2025-01-09 14:47:34,261 INFO L226 Difference]: Without dead ends: 1181 [2025-01-09 14:47:34,264 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 14:47:34,264 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 444 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:34,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1288 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:34,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2025-01-09 14:47:34,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 687. [2025-01-09 14:47:34,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 502 states have (on average 1.5099601593625498) internal successors, (758), 502 states have internal predecessors, (758), 182 states have call successors, (182), 2 states have call predecessors, (182), 2 states have return successors, (182), 182 states have call predecessors, (182), 182 states have call successors, (182) [2025-01-09 14:47:34,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1122 transitions. [2025-01-09 14:47:34,360 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1122 transitions. Word has length 596 [2025-01-09 14:47:34,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:34,361 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1122 transitions. [2025-01-09 14:47:34,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 14:47:34,362 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1122 transitions. [2025-01-09 14:47:34,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-01-09 14:47:34,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:34,369 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:34,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:47:34,369 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:34,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:34,370 INFO L85 PathProgramCache]: Analyzing trace with hash 208872617, now seen corresponding path program 1 times [2025-01-09 14:47:34,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:34,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868676282] [2025-01-09 14:47:34,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:34,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:34,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-01-09 14:47:34,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-01-09 14:47:34,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:34,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-01-09 14:47:35,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:35,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868676282] [2025-01-09 14:47:35,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868676282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:35,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:35,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:35,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714133425] [2025-01-09 14:47:35,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:35,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:35,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:35,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:35,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:35,249 INFO L87 Difference]: Start difference. First operand 687 states and 1122 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 14:47:35,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:35,368 INFO L93 Difference]: Finished difference Result 1715 states and 2808 transitions. [2025-01-09 14:47:35,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:35,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 596 [2025-01-09 14:47:35,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:35,377 INFO L225 Difference]: With dead ends: 1715 [2025-01-09 14:47:35,377 INFO L226 Difference]: Without dead ends: 1031 [2025-01-09 14:47:35,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 14:47:35,380 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 483 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:35,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1323 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:35,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2025-01-09 14:47:35,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1029. [2025-01-09 14:47:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 752 states have (on average 1.5079787234042554) internal successors, (1134), 752 states have internal predecessors, (1134), 273 states have call successors, (273), 3 states have call predecessors, (273), 3 states have return successors, (273), 273 states have call predecessors, (273), 273 states have call successors, (273) [2025-01-09 14:47:35,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1680 transitions. [2025-01-09 14:47:35,460 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1680 transitions. Word has length 596 [2025-01-09 14:47:35,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:35,461 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1680 transitions. [2025-01-09 14:47:35,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 14:47:35,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1680 transitions. [2025-01-09 14:47:35,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-01-09 14:47:35,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:35,468 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:35,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:47:35,468 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:35,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:35,469 INFO L85 PathProgramCache]: Analyzing trace with hash -721293845, now seen corresponding path program 1 times [2025-01-09 14:47:35,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:35,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094545163] [2025-01-09 14:47:35,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:35,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:35,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-01-09 14:47:35,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-01-09 14:47:35,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:35,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-01-09 14:47:36,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:36,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094545163] [2025-01-09 14:47:36,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094545163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:36,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:36,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:36,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969936436] [2025-01-09 14:47:36,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:36,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:36,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:36,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:36,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:36,243 INFO L87 Difference]: Start difference. First operand 1029 states and 1680 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 14:47:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:36,332 INFO L93 Difference]: Finished difference Result 3079 states and 5032 transitions. [2025-01-09 14:47:36,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:36,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 596 [2025-01-09 14:47:36,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:36,343 INFO L225 Difference]: With dead ends: 3079 [2025-01-09 14:47:36,343 INFO L226 Difference]: Without dead ends: 2053 [2025-01-09 14:47:36,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 14:47:36,347 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 291 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:36,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 980 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:36,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2025-01-09 14:47:36,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 2043. [2025-01-09 14:47:36,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2043 states, 1490 states have (on average 1.5073825503355704) internal successors, (2246), 1490 states have internal predecessors, (2246), 546 states have call successors, (546), 6 states have call predecessors, (546), 6 states have return successors, (546), 546 states have call predecessors, (546), 546 states have call successors, (546) [2025-01-09 14:47:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 3338 transitions. [2025-01-09 14:47:36,491 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 3338 transitions. Word has length 596 [2025-01-09 14:47:36,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:36,492 INFO L471 AbstractCegarLoop]: Abstraction has 2043 states and 3338 transitions. [2025-01-09 14:47:36,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 14:47:36,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 3338 transitions. [2025-01-09 14:47:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-01-09 14:47:36,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:36,513 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:36,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:47:36,513 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:36,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:36,514 INFO L85 PathProgramCache]: Analyzing trace with hash -222331967, now seen corresponding path program 1 times [2025-01-09 14:47:36,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:36,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820027285] [2025-01-09 14:47:36,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:36,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:36,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-01-09 14:47:38,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-01-09 14:47:38,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:38,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:39,345 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 105 proven. 165 refuted. 0 times theorem prover too weak. 16110 trivial. 0 not checked. [2025-01-09 14:47:39,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:39,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820027285] [2025-01-09 14:47:39,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820027285] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:39,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562384475] [2025-01-09 14:47:39,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:39,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:39,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:39,352 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 14:47:39,354 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 14:47:39,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-01-09 14:47:39,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-01-09 14:47:39,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:39,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:39,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 1438 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 14:47:39,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:40,737 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 6388 proven. 69 refuted. 0 times theorem prover too weak. 9923 trivial. 0 not checked. [2025-01-09 14:47:40,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:47:41,350 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 201 proven. 69 refuted. 0 times theorem prover too weak. 16110 trivial. 0 not checked. [2025-01-09 14:47:41,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562384475] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:47:41,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:47:41,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 17 [2025-01-09 14:47:41,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763881189] [2025-01-09 14:47:41,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:47:41,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 14:47:41,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:41,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 14:47:41,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:47:41,353 INFO L87 Difference]: Start difference. First operand 2043 states and 3338 transitions. Second operand has 17 states, 17 states have (on average 17.58823529411765) internal successors, (299), 17 states have internal predecessors, (299), 5 states have call successors, (237), 3 states have call predecessors, (237), 6 states have return successors, (238), 5 states have call predecessors, (238), 5 states have call successors, (238) [2025-01-09 14:47:45,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:45,710 INFO L93 Difference]: Finished difference Result 18269 states and 29506 transitions. [2025-01-09 14:47:45,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-09 14:47:45,711 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 17.58823529411765) internal successors, (299), 17 states have internal predecessors, (299), 5 states have call successors, (237), 3 states have call predecessors, (237), 6 states have return successors, (238), 5 states have call predecessors, (238), 5 states have call successors, (238) Word has length 597 [2025-01-09 14:47:45,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:45,775 INFO L225 Difference]: With dead ends: 18269 [2025-01-09 14:47:45,775 INFO L226 Difference]: Without dead ends: 16229 [2025-01-09 14:47:45,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1259 GetRequests, 1195 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=847, Invalid=3443, Unknown=0, NotChecked=0, Total=4290 [2025-01-09 14:47:45,787 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 6649 mSDsluCounter, 4353 mSDsCounter, 0 mSdLazyCounter, 3732 mSolverCounterSat, 1565 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6687 SdHoareTripleChecker+Valid, 5071 SdHoareTripleChecker+Invalid, 5297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1565 IncrementalHoareTripleChecker+Valid, 3732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:45,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6687 Valid, 5071 Invalid, 5297 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1565 Valid, 3732 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-09 14:47:45,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16229 states. [2025-01-09 14:47:46,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16229 to 12949. [2025-01-09 14:47:46,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12949 states, 10788 states have (on average 1.5413422321097516) internal successors, (16628), 10812 states have internal predecessors, (16628), 2088 states have call successors, (2088), 72 states have call predecessors, (2088), 72 states have return successors, (2088), 2064 states have call predecessors, (2088), 2088 states have call successors, (2088) [2025-01-09 14:47:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12949 states to 12949 states and 20804 transitions. [2025-01-09 14:47:46,418 INFO L78 Accepts]: Start accepts. Automaton has 12949 states and 20804 transitions. Word has length 597 [2025-01-09 14:47:46,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:46,419 INFO L471 AbstractCegarLoop]: Abstraction has 12949 states and 20804 transitions. [2025-01-09 14:47:46,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 17.58823529411765) internal successors, (299), 17 states have internal predecessors, (299), 5 states have call successors, (237), 3 states have call predecessors, (237), 6 states have return successors, (238), 5 states have call predecessors, (238), 5 states have call successors, (238) [2025-01-09 14:47:46,420 INFO L276 IsEmpty]: Start isEmpty. Operand 12949 states and 20804 transitions. [2025-01-09 14:47:46,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-01-09 14:47:46,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:46,426 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:46,434 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 14:47:46,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:46,630 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:46,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:46,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1640469192, now seen corresponding path program 1 times [2025-01-09 14:47:46,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:46,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347680532] [2025-01-09 14:47:46,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:46,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:46,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-01-09 14:47:47,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-01-09 14:47:47,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:47,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:48,510 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 9 proven. 261 refuted. 0 times theorem prover too weak. 16110 trivial. 0 not checked. [2025-01-09 14:47:48,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:48,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347680532] [2025-01-09 14:47:48,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347680532] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:48,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499744169] [2025-01-09 14:47:48,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:48,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:48,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:48,513 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 14:47:48,515 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 14:47:48,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-01-09 14:47:48,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-01-09 14:47:48,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:48,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:48,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 14:47:48,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 6388 proven. 69 refuted. 0 times theorem prover too weak. 9923 trivial. 0 not checked. [2025-01-09 14:47:49,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:47:49,498 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 201 proven. 69 refuted. 0 times theorem prover too weak. 16110 trivial. 0 not checked. [2025-01-09 14:47:49,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499744169] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:47:49,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:47:49,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 9 [2025-01-09 14:47:49,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667586548] [2025-01-09 14:47:49,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:47:49,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:47:49,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:49,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:47:49,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:47:49,505 INFO L87 Difference]: Start difference. First operand 12949 states and 20804 transitions. Second operand has 9 states, 9 states have (on average 26.444444444444443) internal successors, (238), 9 states have internal predecessors, (238), 3 states have call successors, (201), 2 states have call predecessors, (201), 4 states have return successors, (203), 3 states have call predecessors, (203), 3 states have call successors, (203) [2025-01-09 14:47:50,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:50,458 INFO L93 Difference]: Finished difference Result 22859 states and 36471 transitions. [2025-01-09 14:47:50,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:47:50,461 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.444444444444443) internal successors, (238), 9 states have internal predecessors, (238), 3 states have call successors, (201), 2 states have call predecessors, (201), 4 states have return successors, (203), 3 states have call predecessors, (203), 3 states have call successors, (203) Word has length 598 [2025-01-09 14:47:50,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:50,525 INFO L225 Difference]: With dead ends: 22859 [2025-01-09 14:47:50,525 INFO L226 Difference]: Without dead ends: 9841 [2025-01-09 14:47:50,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1211 GetRequests, 1191 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:47:50,555 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 1299 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 694 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 694 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:50,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 900 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [694 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:47:50,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9841 states. [2025-01-09 14:47:51,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9841 to 9391. [2025-01-09 14:47:51,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9391 states, 7194 states have (on average 1.4445371142618848) internal successors, (10392), 7218 states have internal predecessors, (10392), 2088 states have call successors, (2088), 108 states have call predecessors, (2088), 108 states have return successors, (2088), 2064 states have call predecessors, (2088), 2088 states have call successors, (2088) [2025-01-09 14:47:51,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9391 states to 9391 states and 14568 transitions. [2025-01-09 14:47:51,225 INFO L78 Accepts]: Start accepts. Automaton has 9391 states and 14568 transitions. Word has length 598 [2025-01-09 14:47:51,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:51,227 INFO L471 AbstractCegarLoop]: Abstraction has 9391 states and 14568 transitions. [2025-01-09 14:47:51,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.444444444444443) internal successors, (238), 9 states have internal predecessors, (238), 3 states have call successors, (201), 2 states have call predecessors, (201), 4 states have return successors, (203), 3 states have call predecessors, (203), 3 states have call successors, (203) [2025-01-09 14:47:51,228 INFO L276 IsEmpty]: Start isEmpty. Operand 9391 states and 14568 transitions. [2025-01-09 14:47:51,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-01-09 14:47:51,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:51,233 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:51,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 14:47:51,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:51,438 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:51,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:51,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1079612494, now seen corresponding path program 1 times [2025-01-09 14:47:51,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:51,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011268933] [2025-01-09 14:47:51,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:51,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:51,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-01-09 14:47:51,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-01-09 14:47:51,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:51,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:51,646 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-01-09 14:47:51,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:51,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011268933] [2025-01-09 14:47:51,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011268933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:51,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:51,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:51,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947405126] [2025-01-09 14:47:51,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:51,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:51,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:51,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:51,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:51,648 INFO L87 Difference]: Start difference. First operand 9391 states and 14568 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 14:47:52,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:52,662 INFO L93 Difference]: Finished difference Result 23413 states and 36332 transitions. [2025-01-09 14:47:52,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:52,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 598 [2025-01-09 14:47:52,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:52,744 INFO L225 Difference]: With dead ends: 23413 [2025-01-09 14:47:52,744 INFO L226 Difference]: Without dead ends: 14025 [2025-01-09 14:47:52,764 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 14:47:52,765 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 416 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:52,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 924 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:52,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14025 states. [2025-01-09 14:47:53,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14025 to 12313. [2025-01-09 14:47:53,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12313 states, 8616 states have (on average 1.388811513463324) internal successors, (11966), 8640 states have internal predecessors, (11966), 3522 states have call successors, (3522), 174 states have call predecessors, (3522), 174 states have return successors, (3522), 3498 states have call predecessors, (3522), 3522 states have call successors, (3522) [2025-01-09 14:47:53,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12313 states to 12313 states and 19010 transitions. [2025-01-09 14:47:53,896 INFO L78 Accepts]: Start accepts. Automaton has 12313 states and 19010 transitions. Word has length 598 [2025-01-09 14:47:53,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:53,898 INFO L471 AbstractCegarLoop]: Abstraction has 12313 states and 19010 transitions. [2025-01-09 14:47:53,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 14:47:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 12313 states and 19010 transitions. [2025-01-09 14:47:53,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-01-09 14:47:53,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:53,903 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:53,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:47:53,903 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:53,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:53,904 INFO L85 PathProgramCache]: Analyzing trace with hash -655699630, now seen corresponding path program 1 times [2025-01-09 14:47:53,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:53,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785168332] [2025-01-09 14:47:53,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:53,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:53,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-01-09 14:47:54,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-01-09 14:47:54,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:54,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-01-09 14:47:55,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:55,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785168332] [2025-01-09 14:47:55,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785168332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:55,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:55,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:47:55,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870901537] [2025-01-09 14:47:55,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:55,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:47:55,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:55,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:47:55,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:55,676 INFO L87 Difference]: Start difference. First operand 12313 states and 19010 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 14:47:56,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:56,742 INFO L93 Difference]: Finished difference Result 32007 states and 49214 transitions. [2025-01-09 14:47:56,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:47:56,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 598 [2025-01-09 14:47:56,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:56,824 INFO L225 Difference]: With dead ends: 32007 [2025-01-09 14:47:56,824 INFO L226 Difference]: Without dead ends: 19697 [2025-01-09 14:47:56,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:47:56,867 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 713 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 1772 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:56,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 1772 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:47:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19697 states. [2025-01-09 14:47:58,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19697 to 15635. [2025-01-09 14:47:58,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15635 states, 11890 states have (on average 1.4244743481917579) internal successors, (16937), 11926 states have internal predecessors, (16937), 3558 states have call successors, (3558), 186 states have call predecessors, (3558), 186 states have return successors, (3558), 3522 states have call predecessors, (3558), 3558 states have call successors, (3558) [2025-01-09 14:47:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15635 states to 15635 states and 24053 transitions. [2025-01-09 14:47:58,121 INFO L78 Accepts]: Start accepts. Automaton has 15635 states and 24053 transitions. Word has length 598 [2025-01-09 14:47:58,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:58,122 INFO L471 AbstractCegarLoop]: Abstraction has 15635 states and 24053 transitions. [2025-01-09 14:47:58,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 14:47:58,122 INFO L276 IsEmpty]: Start isEmpty. Operand 15635 states and 24053 transitions. [2025-01-09 14:47:58,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-01-09 14:47:58,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:58,128 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:58,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:47:58,128 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:58,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:58,129 INFO L85 PathProgramCache]: Analyzing trace with hash 600056276, now seen corresponding path program 1 times [2025-01-09 14:47:58,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:58,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136613684] [2025-01-09 14:47:58,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:58,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:58,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-01-09 14:47:58,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-01-09 14:47:58,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:58,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-01-09 14:47:58,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:58,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136613684] [2025-01-09 14:47:58,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136613684] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:58,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:58,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:47:58,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993041050] [2025-01-09 14:47:58,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:58,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:47:58,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:58,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:47:58,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:58,559 INFO L87 Difference]: Start difference. First operand 15635 states and 24053 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 2 states have call predecessors, (91), 2 states have call successors, (91) [2025-01-09 14:47:59,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:59,523 INFO L93 Difference]: Finished difference Result 46899 states and 72153 transitions. [2025-01-09 14:47:59,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:59,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 2 states have call predecessors, (91), 2 states have call successors, (91) Word has length 598 [2025-01-09 14:47:59,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:59,637 INFO L225 Difference]: With dead ends: 46899 [2025-01-09 14:47:59,637 INFO L226 Difference]: Without dead ends: 31267 [2025-01-09 14:47:59,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 14:47:59,671 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 402 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:59,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1415 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:59,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31267 states. [2025-01-09 14:48:02,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31267 to 31265. [2025-01-09 14:48:02,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31265 states, 23776 states have (on average 1.4212651413189772) internal successors, (33792), 23848 states have internal predecessors, (33792), 7116 states have call successors, (7116), 372 states have call predecessors, (7116), 372 states have return successors, (7116), 7044 states have call predecessors, (7116), 7116 states have call successors, (7116) [2025-01-09 14:48:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31265 states to 31265 states and 48024 transitions. [2025-01-09 14:48:02,453 INFO L78 Accepts]: Start accepts. Automaton has 31265 states and 48024 transitions. Word has length 598 [2025-01-09 14:48:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:02,454 INFO L471 AbstractCegarLoop]: Abstraction has 31265 states and 48024 transitions. [2025-01-09 14:48:02,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 2 states have call predecessors, (91), 2 states have call successors, (91) [2025-01-09 14:48:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 31265 states and 48024 transitions. [2025-01-09 14:48:02,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-01-09 14:48:02,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:02,463 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:48:02,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:48:02,463 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:02,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:02,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1497449554, now seen corresponding path program 1 times [2025-01-09 14:48:02,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:02,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063824785] [2025-01-09 14:48:02,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:02,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:02,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-01-09 14:48:11,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-01-09 14:48:11,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:11,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:11,519 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 204 proven. 66 refuted. 0 times theorem prover too weak. 16110 trivial. 0 not checked. [2025-01-09 14:48:11,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:11,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063824785] [2025-01-09 14:48:11,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063824785] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:48:11,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004235872] [2025-01-09 14:48:11,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:11,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:11,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:11,523 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 14:48:11,528 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 14:48:11,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-01-09 14:48:11,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-01-09 14:48:11,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:11,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:11,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 1443 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:48:11,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:48:12,110 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 6210 proven. 66 refuted. 0 times theorem prover too weak. 10104 trivial. 0 not checked. [2025-01-09 14:48:12,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:48:12,542 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 204 proven. 66 refuted. 0 times theorem prover too weak. 16110 trivial. 0 not checked. [2025-01-09 14:48:12,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004235872] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:48:12,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:48:12,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-01-09 14:48:12,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765639399] [2025-01-09 14:48:12,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:48:12,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:48:12,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:12,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:48:12,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:48:12,545 INFO L87 Difference]: Start difference. First operand 31265 states and 48024 transitions. Second operand has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 3 states have call successors, (135), 2 states have call predecessors, (135), 4 states have return successors, (136), 3 states have call predecessors, (136), 3 states have call successors, (136) [2025-01-09 14:48:14,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:14,517 INFO L93 Difference]: Finished difference Result 63113 states and 96598 transitions. [2025-01-09 14:48:14,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 14:48:14,518 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 3 states have call successors, (135), 2 states have call predecessors, (135), 4 states have return successors, (136), 3 states have call predecessors, (136), 3 states have call successors, (136) Word has length 598 [2025-01-09 14:48:14,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:14,663 INFO L225 Difference]: With dead ends: 63113 [2025-01-09 14:48:14,664 INFO L226 Difference]: Without dead ends: 31823 [2025-01-09 14:48:14,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1210 GetRequests, 1193 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:48:14,741 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 1234 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1303 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:14,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1303 Valid, 1328 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:48:14,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31823 states. [2025-01-09 14:48:16,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31823 to 31505. [2025-01-09 14:48:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31505 states, 23956 states have (on average 1.4169310402404407) internal successors, (33944), 24028 states have internal predecessors, (33944), 7116 states have call successors, (7116), 432 states have call predecessors, (7116), 432 states have return successors, (7116), 7044 states have call predecessors, (7116), 7116 states have call successors, (7116) [2025-01-09 14:48:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31505 states to 31505 states and 48176 transitions. [2025-01-09 14:48:16,981 INFO L78 Accepts]: Start accepts. Automaton has 31505 states and 48176 transitions. Word has length 598 [2025-01-09 14:48:16,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:16,982 INFO L471 AbstractCegarLoop]: Abstraction has 31505 states and 48176 transitions. [2025-01-09 14:48:16,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 3 states have call successors, (135), 2 states have call predecessors, (135), 4 states have return successors, (136), 3 states have call predecessors, (136), 3 states have call successors, (136) [2025-01-09 14:48:16,982 INFO L276 IsEmpty]: Start isEmpty. Operand 31505 states and 48176 transitions. [2025-01-09 14:48:16,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-01-09 14:48:16,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:16,992 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:48:17,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 14:48:17,192 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,SelfDestructingSolverStorable10 [2025-01-09 14:48:17,193 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:17,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:17,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1933145791, now seen corresponding path program 1 times [2025-01-09 14:48:17,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:17,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230107478] [2025-01-09 14:48:17,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:17,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:17,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-01-09 14:48:17,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-01-09 14:48:17,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:17,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-01-09 14:48:17,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:17,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230107478] [2025-01-09 14:48:17,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230107478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:17,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:17,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:48:17,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888180279] [2025-01-09 14:48:17,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:17,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:48:17,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:17,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:48:17,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:48:17,805 INFO L87 Difference]: Start difference. First operand 31505 states and 48176 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 14:48:19,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:19,329 INFO L93 Difference]: Finished difference Result 64855 states and 99115 transitions. [2025-01-09 14:48:19,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:48:19,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 598 [2025-01-09 14:48:19,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:19,627 INFO L225 Difference]: With dead ends: 64855 [2025-01-09 14:48:19,627 INFO L226 Difference]: Without dead ends: 33353 [2025-01-09 14:48:19,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:48:19,664 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 356 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:19,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1403 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:48:19,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33353 states. [2025-01-09 14:48:22,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33353 to 32355. [2025-01-09 14:48:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32355 states, 24709 states have (on average 1.4186328868023796) internal successors, (35053), 24781 states have internal predecessors, (35053), 7207 states have call successors, (7207), 438 states have call predecessors, (7207), 438 states have return successors, (7207), 7135 states have call predecessors, (7207), 7207 states have call successors, (7207) [2025-01-09 14:48:22,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32355 states to 32355 states and 49467 transitions. [2025-01-09 14:48:22,373 INFO L78 Accepts]: Start accepts. Automaton has 32355 states and 49467 transitions. Word has length 598 [2025-01-09 14:48:22,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:22,374 INFO L471 AbstractCegarLoop]: Abstraction has 32355 states and 49467 transitions. [2025-01-09 14:48:22,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 14:48:22,374 INFO L276 IsEmpty]: Start isEmpty. Operand 32355 states and 49467 transitions. [2025-01-09 14:48:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-01-09 14:48:22,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:22,381 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:48:22,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:48:22,382 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:22,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:22,382 INFO L85 PathProgramCache]: Analyzing trace with hash 723139948, now seen corresponding path program 1 times [2025-01-09 14:48:22,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:22,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561363524] [2025-01-09 14:48:22,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:22,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:22,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-01-09 14:48:23,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-01-09 14:48:23,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:23,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:24,815 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 75 proven. 195 refuted. 0 times theorem prover too weak. 16110 trivial. 0 not checked. [2025-01-09 14:48:24,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:24,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561363524] [2025-01-09 14:48:24,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561363524] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:48:24,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483038829] [2025-01-09 14:48:24,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:24,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:24,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:24,818 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 14:48:24,822 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 14:48:25,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-01-09 14:48:25,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-01-09 14:48:25,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:25,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:25,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 1444 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:48:25,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:48:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 6640 proven. 195 refuted. 0 times theorem prover too weak. 9545 trivial. 0 not checked. [2025-01-09 14:48:25,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:48:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 75 proven. 195 refuted. 0 times theorem prover too weak. 16110 trivial. 0 not checked. [2025-01-09 14:48:26,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483038829] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:48:26,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:48:26,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-01-09 14:48:26,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181923963] [2025-01-09 14:48:26,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:48:26,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 14:48:26,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:26,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 14:48:26,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:48:26,265 INFO L87 Difference]: Start difference. First operand 32355 states and 49467 transitions. Second operand has 13 states, 13 states have (on average 23.53846153846154) internal successors, (306), 13 states have internal predecessors, (306), 5 states have call successors, (247), 2 states have call predecessors, (247), 4 states have return successors, (248), 5 states have call predecessors, (248), 5 states have call successors, (248) [2025-01-09 14:48:29,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:29,067 INFO L93 Difference]: Finished difference Result 83045 states and 125805 transitions. [2025-01-09 14:48:29,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 14:48:29,068 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 23.53846153846154) internal successors, (306), 13 states have internal predecessors, (306), 5 states have call successors, (247), 2 states have call predecessors, (247), 4 states have return successors, (248), 5 states have call predecessors, (248), 5 states have call successors, (248) Word has length 599 [2025-01-09 14:48:29,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:29,255 INFO L225 Difference]: With dead ends: 83045 [2025-01-09 14:48:29,255 INFO L226 Difference]: Without dead ends: 51186 [2025-01-09 14:48:29,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1217 GetRequests, 1195 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-01-09 14:48:29,335 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 2151 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 659 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 659 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:29,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2152 Valid, 1215 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [659 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:48:29,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51186 states. [2025-01-09 14:48:33,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51186 to 50396. [2025-01-09 14:48:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50396 states, 40264 states have (on average 1.4239022451818002) internal successors, (57332), 40444 states have internal predecessors, (57332), 9379 states have call successors, (9379), 752 states have call predecessors, (9379), 752 states have return successors, (9379), 9199 states have call predecessors, (9379), 9379 states have call successors, (9379) [2025-01-09 14:48:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50396 states to 50396 states and 76090 transitions. [2025-01-09 14:48:33,868 INFO L78 Accepts]: Start accepts. Automaton has 50396 states and 76090 transitions. Word has length 599 [2025-01-09 14:48:33,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:33,869 INFO L471 AbstractCegarLoop]: Abstraction has 50396 states and 76090 transitions. [2025-01-09 14:48:33,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 23.53846153846154) internal successors, (306), 13 states have internal predecessors, (306), 5 states have call successors, (247), 2 states have call predecessors, (247), 4 states have return successors, (248), 5 states have call predecessors, (248), 5 states have call successors, (248) [2025-01-09 14:48:33,869 INFO L276 IsEmpty]: Start isEmpty. Operand 50396 states and 76090 transitions. [2025-01-09 14:48:33,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-01-09 14:48:33,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:33,875 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:48:33,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 14:48:34,075 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,SelfDestructingSolverStorable12 [2025-01-09 14:48:34,076 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:34,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:34,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1984057198, now seen corresponding path program 1 times [2025-01-09 14:48:34,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:34,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693082453] [2025-01-09 14:48:34,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:34,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:34,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-01-09 14:48:37,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-01-09 14:48:37,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:37,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat