./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-38.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-38.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 22f39f2d47020c6c74bd46a8e88abd85ecc8d2cba04a8c3eaf7d602b79a3fb5b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:46:14,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:46:14,531 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:46:14,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:46:14,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:46:14,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:46:14,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:46:14,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:46:14,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:46:14,551 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:46:14,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:46:14,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:46:14,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:46:14,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:46:14,552 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:46:14,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:46:14,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:46:14,552 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:46:14,552 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:46:14,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:46:14,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:46:14,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:46:14,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:46:14,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:46:14,552 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:46:14,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:46:14,552 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:46:14,552 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:46:14,552 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:46:14,552 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:46:14,552 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:46:14,552 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:46:14,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:46:14,552 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:46:14,552 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:46:14,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:46:14,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:46:14,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:46:14,553 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:46:14,553 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:46:14,553 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:46:14,553 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:46:14,553 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:46:14,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:46:14,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:46:14,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:46:14,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:46:14,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:46:14,553 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 -> 22f39f2d47020c6c74bd46a8e88abd85ecc8d2cba04a8c3eaf7d602b79a3fb5b [2025-01-09 14:46:14,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:46:14,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:46:14,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:46:14,737 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:46:14,738 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:46:14,738 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-38.i [2025-01-09 14:46:15,880 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4197f5e4a/c2c32aa991fc4b38bf7a0dc6c81e4c94/FLAGedfce082a [2025-01-09 14:46:16,203 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:46:16,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-38.i [2025-01-09 14:46:16,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4197f5e4a/c2c32aa991fc4b38bf7a0dc6c81e4c94/FLAGedfce082a [2025-01-09 14:46:16,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4197f5e4a/c2c32aa991fc4b38bf7a0dc6c81e4c94 [2025-01-09 14:46:16,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:46:16,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:46:16,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:46:16,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:46:16,485 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:46:16,486 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:46:16" (1/1) ... [2025-01-09 14:46:16,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b219e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:16, skipping insertion in model container [2025-01-09 14:46:16,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:46:16" (1/1) ... [2025-01-09 14:46:16,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:46:16,631 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-38.i[916,929] [2025-01-09 14:46:16,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:46:16,849 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:46:16,857 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-38.i[916,929] [2025-01-09 14:46:16,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:46:16,960 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:46:16,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:16 WrapperNode [2025-01-09 14:46:16,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:46:16,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:46:16,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:46:16,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:46:16,968 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:46:16" (1/1) ... [2025-01-09 14:46:16,988 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:46:16" (1/1) ... [2025-01-09 14:46:17,075 INFO L138 Inliner]: procedures = 26, calls = 84, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 664 [2025-01-09 14:46:17,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:46:17,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:46:17,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:46:17,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:46:17,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:16" (1/1) ... [2025-01-09 14:46:17,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:16" (1/1) ... [2025-01-09 14:46:17,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:16" (1/1) ... [2025-01-09 14:46:17,165 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:46:17,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:16" (1/1) ... [2025-01-09 14:46:17,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:16" (1/1) ... [2025-01-09 14:46:17,198 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:16" (1/1) ... [2025-01-09 14:46:17,206 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:16" (1/1) ... [2025-01-09 14:46:17,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:16" (1/1) ... [2025-01-09 14:46:17,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:16" (1/1) ... [2025-01-09 14:46:17,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:16" (1/1) ... [2025-01-09 14:46:17,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:46:17,235 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:46:17,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:46:17,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:46:17,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:16" (1/1) ... [2025-01-09 14:46:17,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:46:17,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:17,258 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:46:17,272 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:46:17,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:46:17,288 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:46:17,288 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:46:17,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:46:17,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:46:17,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:46:17,412 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:46:17,413 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:46:18,438 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-01-09 14:46:18,439 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:46:18,455 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:46:18,455 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:46:18,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:46:18 BoogieIcfgContainer [2025-01-09 14:46:18,456 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:46:18,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:46:18,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:46:18,461 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:46:18,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:46:16" (1/3) ... [2025-01-09 14:46:18,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e98230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:46:18, skipping insertion in model container [2025-01-09 14:46:18,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:16" (2/3) ... [2025-01-09 14:46:18,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e98230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:46:18, skipping insertion in model container [2025-01-09 14:46:18,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:46:18" (3/3) ... [2025-01-09 14:46:18,465 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-38.i [2025-01-09 14:46:18,476 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:46:18,479 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-38.i that has 2 procedures, 271 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:46:18,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:46:18,544 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;@39ea5781, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:46:18,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:46:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 271 states, 197 states have (on average 1.5380710659898478) internal successors, (303), 198 states have internal predecessors, (303), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-01-09 14:46:18,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 14:46:18,587 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:18,588 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:18,589 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:18,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:18,593 INFO L85 PathProgramCache]: Analyzing trace with hash -261884492, now seen corresponding path program 1 times [2025-01-09 14:46:18,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:18,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349430690] [2025-01-09 14:46:18,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:18,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:18,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:46:18,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:46:18,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:18,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2025-01-09 14:46:19,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:19,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349430690] [2025-01-09 14:46:19,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349430690] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:46:19,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142912335] [2025-01-09 14:46:19,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:19,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:19,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:19,203 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:46:19,204 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:46:19,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:46:19,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:46:19,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:19,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:19,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:46:19,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:46:19,558 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2025-01-09 14:46:19,558 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:46:19,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142912335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:19,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:46:19,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:46:19,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542367808] [2025-01-09 14:46:19,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:19,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:46:19,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:19,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:46:19,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:46:19,592 INFO L87 Difference]: Start difference. First operand has 271 states, 197 states have (on average 1.5380710659898478) internal successors, (303), 198 states have internal predecessors, (303), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 2 states, 2 states have (on average 66.5) internal successors, (133), 2 states have internal predecessors, (133), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2025-01-09 14:46:19,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:19,636 INFO L93 Difference]: Finished difference Result 536 states and 956 transitions. [2025-01-09 14:46:19,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:46:19,638 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 66.5) internal successors, (133), 2 states have internal predecessors, (133), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) Word has length 483 [2025-01-09 14:46:19,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:19,647 INFO L225 Difference]: With dead ends: 536 [2025-01-09 14:46:19,647 INFO L226 Difference]: Without dead ends: 268 [2025-01-09 14:46:19,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 484 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:46:19,655 INFO L435 NwaCegarLoop]: 438 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, 438 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:46:19,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:46:19,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-01-09 14:46:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-01-09 14:46:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 195 states have (on average 1.5179487179487179) internal successors, (296), 195 states have internal predecessors, (296), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-01-09 14:46:19,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 438 transitions. [2025-01-09 14:46:19,724 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 438 transitions. Word has length 483 [2025-01-09 14:46:19,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:19,725 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 438 transitions. [2025-01-09 14:46:19,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.5) internal successors, (133), 2 states have internal predecessors, (133), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2025-01-09 14:46:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 438 transitions. [2025-01-09 14:46:19,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 14:46:19,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:19,736 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:19,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:46:19,940 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:46:19,941 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:19,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:19,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1238197254, now seen corresponding path program 1 times [2025-01-09 14:46:19,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:19,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108979292] [2025-01-09 14:46:19,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:19,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:20,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:46:20,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:46:20,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:20,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-01-09 14:46:20,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:20,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108979292] [2025-01-09 14:46:20,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108979292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:20,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:20,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:46:20,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599226458] [2025-01-09 14:46:20,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:20,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:46:20,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:20,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:46:20,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:46:20,295 INFO L87 Difference]: Start difference. First operand 268 states and 438 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:20,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:20,459 INFO L93 Difference]: Finished difference Result 788 states and 1289 transitions. [2025-01-09 14:46:20,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:46:20,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 483 [2025-01-09 14:46:20,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:20,467 INFO L225 Difference]: With dead ends: 788 [2025-01-09 14:46:20,468 INFO L226 Difference]: Without dead ends: 523 [2025-01-09 14:46:20,470 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:46:20,472 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 406 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:20,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1191 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:46:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-01-09 14:46:20,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 322. [2025-01-09 14:46:20,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 249 states have (on average 1.5301204819277108) internal successors, (381), 249 states have internal predecessors, (381), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-01-09 14:46:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 523 transitions. [2025-01-09 14:46:20,510 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 523 transitions. Word has length 483 [2025-01-09 14:46:20,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:20,512 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 523 transitions. [2025-01-09 14:46:20,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:20,513 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 523 transitions. [2025-01-09 14:46:20,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 14:46:20,519 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:20,520 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:20,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:46:20,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:20,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:20,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1445098356, now seen corresponding path program 1 times [2025-01-09 14:46:20,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:20,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444636452] [2025-01-09 14:46:20,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:20,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:20,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:46:20,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:46:20,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:20,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-01-09 14:46:20,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:20,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444636452] [2025-01-09 14:46:20,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444636452] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:20,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:20,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:46:20,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017141263] [2025-01-09 14:46:20,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:20,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:46:20,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:20,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:46:20,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:46:20,922 INFO L87 Difference]: Start difference. First operand 322 states and 523 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:21,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:21,044 INFO L93 Difference]: Finished difference Result 880 states and 1431 transitions. [2025-01-09 14:46:21,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:46:21,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 483 [2025-01-09 14:46:21,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:21,051 INFO L225 Difference]: With dead ends: 880 [2025-01-09 14:46:21,051 INFO L226 Difference]: Without dead ends: 561 [2025-01-09 14:46:21,052 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:46:21,053 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 306 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:21,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 837 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:46:21,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-01-09 14:46:21,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 558. [2025-01-09 14:46:21,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 446 states have (on average 1.5336322869955157) internal successors, (684), 447 states have internal predecessors, (684), 109 states have call successors, (109), 2 states have call predecessors, (109), 2 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-01-09 14:46:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 902 transitions. [2025-01-09 14:46:21,083 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 902 transitions. Word has length 483 [2025-01-09 14:46:21,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:21,084 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 902 transitions. [2025-01-09 14:46:21,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:21,084 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 902 transitions. [2025-01-09 14:46:21,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 14:46:21,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:21,089 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:21,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:46:21,090 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:21,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:21,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1109296204, now seen corresponding path program 1 times [2025-01-09 14:46:21,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:21,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064741409] [2025-01-09 14:46:21,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:21,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:21,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:46:21,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:46:21,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:21,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-01-09 14:46:21,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:21,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064741409] [2025-01-09 14:46:21,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064741409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:21,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:21,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:46:21,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207611368] [2025-01-09 14:46:21,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:21,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:46:21,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:21,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:46:21,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:46:21,370 INFO L87 Difference]: Start difference. First operand 558 states and 902 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:21,498 INFO L93 Difference]: Finished difference Result 1665 states and 2695 transitions. [2025-01-09 14:46:21,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:46:21,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 483 [2025-01-09 14:46:21,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:21,506 INFO L225 Difference]: With dead ends: 1665 [2025-01-09 14:46:21,507 INFO L226 Difference]: Without dead ends: 1110 [2025-01-09 14:46:21,508 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:46:21,508 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 407 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:21,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 881 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:46:21,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2025-01-09 14:46:21,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1108. [2025-01-09 14:46:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 885 states have (on average 1.5141242937853108) internal successors, (1340), 887 states have internal predecessors, (1340), 218 states have call successors, (218), 4 states have call predecessors, (218), 4 states have return successors, (218), 216 states have call predecessors, (218), 218 states have call successors, (218) [2025-01-09 14:46:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1776 transitions. [2025-01-09 14:46:21,599 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1776 transitions. Word has length 483 [2025-01-09 14:46:21,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:21,600 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1776 transitions. [2025-01-09 14:46:21,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:21,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1776 transitions. [2025-01-09 14:46:21,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 14:46:21,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:21,605 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:21,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:46:21,605 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:21,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:21,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1532942926, now seen corresponding path program 1 times [2025-01-09 14:46:21,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:21,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529496481] [2025-01-09 14:46:21,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:21,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:21,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:46:21,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:46:21,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:21,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-01-09 14:46:22,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:22,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529496481] [2025-01-09 14:46:22,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529496481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:22,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:22,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:46:22,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044779879] [2025-01-09 14:46:22,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:22,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:46:22,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:22,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:46:22,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:22,686 INFO L87 Difference]: Start difference. First operand 1108 states and 1776 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:23,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:23,393 INFO L93 Difference]: Finished difference Result 2372 states and 3800 transitions. [2025-01-09 14:46:23,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:46:23,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 483 [2025-01-09 14:46:23,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:23,402 INFO L225 Difference]: With dead ends: 2372 [2025-01-09 14:46:23,402 INFO L226 Difference]: Without dead ends: 1267 [2025-01-09 14:46:23,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:46:23,407 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 447 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:23,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1646 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:46:23,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2025-01-09 14:46:23,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1167. [2025-01-09 14:46:23,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 944 states have (on average 1.5180084745762712) internal successors, (1433), 946 states have internal predecessors, (1433), 218 states have call successors, (218), 4 states have call predecessors, (218), 4 states have return successors, (218), 216 states have call predecessors, (218), 218 states have call successors, (218) [2025-01-09 14:46:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1869 transitions. [2025-01-09 14:46:23,486 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1869 transitions. Word has length 483 [2025-01-09 14:46:23,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:23,487 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1869 transitions. [2025-01-09 14:46:23,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:23,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1869 transitions. [2025-01-09 14:46:23,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-01-09 14:46:23,493 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:23,493 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:23,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:46:23,493 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:23,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:23,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1220155287, now seen corresponding path program 1 times [2025-01-09 14:46:23,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:23,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691629372] [2025-01-09 14:46:23,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:23,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:23,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-01-09 14:46:23,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-01-09 14:46:23,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:23,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:23,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-01-09 14:46:23,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:23,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691629372] [2025-01-09 14:46:23,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691629372] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:23,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:23,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:46:23,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266611964] [2025-01-09 14:46:23,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:23,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:46:23,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:23,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:46:23,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:46:23,719 INFO L87 Difference]: Start difference. First operand 1167 states and 1869 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:23,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:23,819 INFO L93 Difference]: Finished difference Result 2343 states and 3744 transitions. [2025-01-09 14:46:23,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:46:23,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 484 [2025-01-09 14:46:23,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:23,825 INFO L225 Difference]: With dead ends: 2343 [2025-01-09 14:46:23,825 INFO L226 Difference]: Without dead ends: 1179 [2025-01-09 14:46:23,827 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:46:23,827 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 275 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:23,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1130 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:46:23,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2025-01-09 14:46:23,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 989. [2025-01-09 14:46:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 842 states have (on average 1.5403800475059382) internal successors, (1297), 842 states have internal predecessors, (1297), 142 states have call successors, (142), 4 states have call predecessors, (142), 4 states have return successors, (142), 142 states have call predecessors, (142), 142 states have call successors, (142) [2025-01-09 14:46:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1581 transitions. [2025-01-09 14:46:23,860 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1581 transitions. Word has length 484 [2025-01-09 14:46:23,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:23,861 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1581 transitions. [2025-01-09 14:46:23,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1581 transitions. [2025-01-09 14:46:23,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-01-09 14:46:23,864 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:23,864 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:23,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:46:23,864 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:23,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:23,865 INFO L85 PathProgramCache]: Analyzing trace with hash -865688557, now seen corresponding path program 1 times [2025-01-09 14:46:23,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:23,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945423528] [2025-01-09 14:46:23,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:23,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:23,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-01-09 14:46:23,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-01-09 14:46:23,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:23,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-01-09 14:46:24,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:24,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945423528] [2025-01-09 14:46:24,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945423528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:24,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:24,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:46:24,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744325722] [2025-01-09 14:46:24,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:24,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:46:24,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:24,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:46:24,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:46:24,237 INFO L87 Difference]: Start difference. First operand 989 states and 1581 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:25,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:25,043 INFO L93 Difference]: Finished difference Result 3883 states and 6207 transitions. [2025-01-09 14:46:25,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:46:25,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 484 [2025-01-09 14:46:25,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:25,056 INFO L225 Difference]: With dead ends: 3883 [2025-01-09 14:46:25,056 INFO L226 Difference]: Without dead ends: 2897 [2025-01-09 14:46:25,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:46:25,059 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 1201 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 2219 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 571 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:25,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 2219 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [571 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:46:25,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2025-01-09 14:46:25,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 2393. [2025-01-09 14:46:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2393 states, 2100 states have (on average 1.5623809523809524) internal successors, (3281), 2100 states have internal predecessors, (3281), 284 states have call successors, (284), 8 states have call predecessors, (284), 8 states have return successors, (284), 284 states have call predecessors, (284), 284 states have call successors, (284) [2025-01-09 14:46:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3849 transitions. [2025-01-09 14:46:25,140 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3849 transitions. Word has length 484 [2025-01-09 14:46:25,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:25,141 INFO L471 AbstractCegarLoop]: Abstraction has 2393 states and 3849 transitions. [2025-01-09 14:46:25,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:25,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3849 transitions. [2025-01-09 14:46:25,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-01-09 14:46:25,144 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:25,145 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:25,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:46:25,145 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:25,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:25,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1876805807, now seen corresponding path program 1 times [2025-01-09 14:46:25,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:25,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197582428] [2025-01-09 14:46:25,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:25,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:25,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-01-09 14:46:26,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-01-09 14:46:26,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:26,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 48 proven. 162 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-01-09 14:46:26,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:26,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197582428] [2025-01-09 14:46:26,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197582428] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:46:26,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088888085] [2025-01-09 14:46:26,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:26,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:26,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:26,890 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:46:26,893 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:46:27,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-01-09 14:46:27,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-01-09 14:46:27,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:27,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:27,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 14:46:27,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:46:27,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 1618 proven. 192 refuted. 0 times theorem prover too weak. 8130 trivial. 0 not checked. [2025-01-09 14:46:27,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:46:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 18 proven. 192 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-01-09 14:46:28,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088888085] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:46:28,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:46:28,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 12 [2025-01-09 14:46:28,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557841051] [2025-01-09 14:46:28,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:46:28,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:46:28,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:28,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:46:28,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:46:28,436 INFO L87 Difference]: Start difference. First operand 2393 states and 3849 transitions. Second operand has 12 states, 12 states have (on average 24.5) internal successors, (294), 12 states have internal predecessors, (294), 4 states have call successors, (199), 2 states have call predecessors, (199), 4 states have return successors, (201), 4 states have call predecessors, (201), 4 states have call successors, (201) [2025-01-09 14:46:29,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:29,629 INFO L93 Difference]: Finished difference Result 7507 states and 11989 transitions. [2025-01-09 14:46:29,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 14:46:29,633 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 24.5) internal successors, (294), 12 states have internal predecessors, (294), 4 states have call successors, (199), 2 states have call predecessors, (199), 4 states have return successors, (201), 4 states have call predecessors, (201), 4 states have call successors, (201) Word has length 484 [2025-01-09 14:46:29,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:29,653 INFO L225 Difference]: With dead ends: 7507 [2025-01-09 14:46:29,653 INFO L226 Difference]: Without dead ends: 5117 [2025-01-09 14:46:29,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 994 GetRequests, 964 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=228, Invalid=764, Unknown=0, NotChecked=0, Total=992 [2025-01-09 14:46:29,658 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 1579 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 2208 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:29,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 2208 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:46:29,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5117 states. [2025-01-09 14:46:29,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5117 to 4949. [2025-01-09 14:46:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4949 states, 4584 states have (on average 1.5530104712041886) internal successors, (7119), 4588 states have internal predecessors, (7119), 340 states have call successors, (340), 24 states have call predecessors, (340), 24 states have return successors, (340), 336 states have call predecessors, (340), 340 states have call successors, (340) [2025-01-09 14:46:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4949 states to 4949 states and 7799 transitions. [2025-01-09 14:46:29,787 INFO L78 Accepts]: Start accepts. Automaton has 4949 states and 7799 transitions. Word has length 484 [2025-01-09 14:46:29,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:29,788 INFO L471 AbstractCegarLoop]: Abstraction has 4949 states and 7799 transitions. [2025-01-09 14:46:29,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 24.5) internal successors, (294), 12 states have internal predecessors, (294), 4 states have call successors, (199), 2 states have call predecessors, (199), 4 states have return successors, (201), 4 states have call predecessors, (201), 4 states have call successors, (201) [2025-01-09 14:46:29,788 INFO L276 IsEmpty]: Start isEmpty. Operand 4949 states and 7799 transitions. [2025-01-09 14:46:29,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-01-09 14:46:29,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:29,794 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:29,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:46:29,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:29,995 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:29,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:29,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1087080650, now seen corresponding path program 1 times [2025-01-09 14:46:29,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:29,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497508598] [2025-01-09 14:46:29,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:29,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:30,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-01-09 14:46:30,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-01-09 14:46:30,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:30,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:30,346 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-01-09 14:46:30,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:30,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497508598] [2025-01-09 14:46:30,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497508598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:30,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:30,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:46:30,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659818615] [2025-01-09 14:46:30,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:30,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:46:30,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:30,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:46:30,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:46:30,349 INFO L87 Difference]: Start difference. First operand 4949 states and 7799 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:30,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:30,554 INFO L93 Difference]: Finished difference Result 14841 states and 23391 transitions. [2025-01-09 14:46:30,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:46:30,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 485 [2025-01-09 14:46:30,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:30,588 INFO L225 Difference]: With dead ends: 14841 [2025-01-09 14:46:30,589 INFO L226 Difference]: Without dead ends: 9895 [2025-01-09 14:46:30,600 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:46:30,601 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 287 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:30,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 989 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:46:30,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9895 states. [2025-01-09 14:46:31,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9895 to 9893. [2025-01-09 14:46:31,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9893 states, 9164 states have (on average 1.5467044958533391) internal successors, (14174), 9172 states have internal predecessors, (14174), 680 states have call successors, (680), 48 states have call predecessors, (680), 48 states have return successors, (680), 672 states have call predecessors, (680), 680 states have call successors, (680) [2025-01-09 14:46:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9893 states to 9893 states and 15534 transitions. [2025-01-09 14:46:31,089 INFO L78 Accepts]: Start accepts. Automaton has 9893 states and 15534 transitions. Word has length 485 [2025-01-09 14:46:31,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:31,090 INFO L471 AbstractCegarLoop]: Abstraction has 9893 states and 15534 transitions. [2025-01-09 14:46:31,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:31,094 INFO L276 IsEmpty]: Start isEmpty. Operand 9893 states and 15534 transitions. [2025-01-09 14:46:31,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-01-09 14:46:31,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:31,106 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:31,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:46:31,106 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:31,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:31,107 INFO L85 PathProgramCache]: Analyzing trace with hash -278311177, now seen corresponding path program 1 times [2025-01-09 14:46:31,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:31,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077362574] [2025-01-09 14:46:31,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:31,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:31,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-01-09 14:46:31,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-01-09 14:46:31,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:31,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:31,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-01-09 14:46:31,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:31,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077362574] [2025-01-09 14:46:31,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077362574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:31,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:31,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:46:31,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061050630] [2025-01-09 14:46:31,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:31,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:46:31,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:31,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:46:31,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:31,624 INFO L87 Difference]: Start difference. First operand 9893 states and 15534 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:32,127 INFO L93 Difference]: Finished difference Result 29011 states and 45541 transitions. [2025-01-09 14:46:32,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:46:32,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 486 [2025-01-09 14:46:32,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:32,186 INFO L225 Difference]: With dead ends: 29011 [2025-01-09 14:46:32,187 INFO L226 Difference]: Without dead ends: 19121 [2025-01-09 14:46:32,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:46:32,211 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 750 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:32,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1709 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:46:32,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19121 states. [2025-01-09 14:46:32,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19121 to 14849. [2025-01-09 14:46:32,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14849 states, 13756 states have (on average 1.5438354172724629) internal successors, (21237), 13768 states have internal predecessors, (21237), 1020 states have call successors, (1020), 72 states have call predecessors, (1020), 72 states have return successors, (1020), 1008 states have call predecessors, (1020), 1020 states have call successors, (1020) [2025-01-09 14:46:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14849 states to 14849 states and 23277 transitions. [2025-01-09 14:46:32,696 INFO L78 Accepts]: Start accepts. Automaton has 14849 states and 23277 transitions. Word has length 486 [2025-01-09 14:46:32,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:32,696 INFO L471 AbstractCegarLoop]: Abstraction has 14849 states and 23277 transitions. [2025-01-09 14:46:32,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:32,697 INFO L276 IsEmpty]: Start isEmpty. Operand 14849 states and 23277 transitions. [2025-01-09 14:46:32,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-01-09 14:46:32,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:32,708 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:32,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:46:32,708 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:32,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:32,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2021249612, now seen corresponding path program 1 times [2025-01-09 14:46:32,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:32,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225898632] [2025-01-09 14:46:32,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:32,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:32,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-01-09 14:46:33,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-01-09 14:46:33,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:33,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:34,649 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 48 proven. 162 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-01-09 14:46:34,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:34,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225898632] [2025-01-09 14:46:34,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225898632] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:46:34,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745004239] [2025-01-09 14:46:34,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:34,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:34,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:34,652 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:46:34,660 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:46:34,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-01-09 14:46:34,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-01-09 14:46:34,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:34,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:34,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 1167 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:46:34,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:46:35,382 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 4110 proven. 150 refuted. 0 times theorem prover too weak. 5680 trivial. 0 not checked. [2025-01-09 14:46:35,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:46:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 60 proven. 150 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-01-09 14:46:35,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745004239] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:46:35,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:46:35,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-01-09 14:46:35,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962492765] [2025-01-09 14:46:35,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:46:35,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:46:35,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:35,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:46:35,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:46:35,728 INFO L87 Difference]: Start difference. First operand 14849 states and 23277 transitions. Second operand has 10 states, 10 states have (on average 26.3) internal successors, (263), 10 states have internal predecessors, (263), 5 states have call successors, (192), 2 states have call predecessors, (192), 4 states have return successors, (193), 5 states have call predecessors, (193), 5 states have call successors, (193) [2025-01-09 14:46:36,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:36,829 INFO L93 Difference]: Finished difference Result 29661 states and 46468 transitions. [2025-01-09 14:46:36,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 14:46:36,829 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 26.3) internal successors, (263), 10 states have internal predecessors, (263), 5 states have call successors, (192), 2 states have call predecessors, (192), 4 states have return successors, (193), 5 states have call predecessors, (193), 5 states have call successors, (193) Word has length 486 [2025-01-09 14:46:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:36,869 INFO L225 Difference]: With dead ends: 29661 [2025-01-09 14:46:36,869 INFO L226 Difference]: Without dead ends: 14815 [2025-01-09 14:46:36,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 992 GetRequests, 971 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2025-01-09 14:46:36,894 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 1975 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1995 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:36,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1995 Valid, 1439 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:46:36,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14815 states. [2025-01-09 14:46:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14815 to 14765. [2025-01-09 14:46:37,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14765 states, 13660 states have (on average 1.534480234260615) internal successors, (20961), 13672 states have internal predecessors, (20961), 1020 states have call successors, (1020), 84 states have call predecessors, (1020), 84 states have return successors, (1020), 1008 states have call predecessors, (1020), 1020 states have call successors, (1020) [2025-01-09 14:46:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14765 states to 14765 states and 23001 transitions. [2025-01-09 14:46:37,280 INFO L78 Accepts]: Start accepts. Automaton has 14765 states and 23001 transitions. Word has length 486 [2025-01-09 14:46:37,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:37,281 INFO L471 AbstractCegarLoop]: Abstraction has 14765 states and 23001 transitions. [2025-01-09 14:46:37,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.3) internal successors, (263), 10 states have internal predecessors, (263), 5 states have call successors, (192), 2 states have call predecessors, (192), 4 states have return successors, (193), 5 states have call predecessors, (193), 5 states have call successors, (193) [2025-01-09 14:46:37,281 INFO L276 IsEmpty]: Start isEmpty. Operand 14765 states and 23001 transitions. [2025-01-09 14:46:37,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-01-09 14:46:37,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:37,290 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:37,299 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:46:37,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:37,491 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:37,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:37,492 INFO L85 PathProgramCache]: Analyzing trace with hash 318522204, now seen corresponding path program 1 times [2025-01-09 14:46:37,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:37,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054111421] [2025-01-09 14:46:37,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:37,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:37,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-01-09 14:46:37,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-01-09 14:46:37,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:37,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-01-09 14:46:38,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:38,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054111421] [2025-01-09 14:46:38,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054111421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:38,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:38,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:46:38,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220155818] [2025-01-09 14:46:38,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:38,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:46:38,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:38,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:46:38,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:38,144 INFO L87 Difference]: Start difference. First operand 14765 states and 23001 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:39,193 INFO L93 Difference]: Finished difference Result 54161 states and 84055 transitions. [2025-01-09 14:46:39,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:46:39,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 488 [2025-01-09 14:46:39,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:39,276 INFO L225 Difference]: With dead ends: 54161 [2025-01-09 14:46:39,277 INFO L226 Difference]: Without dead ends: 39399 [2025-01-09 14:46:39,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:46:39,304 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 831 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:39,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1931 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:46:39,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39399 states. [2025-01-09 14:46:40,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39399 to 39371. [2025-01-09 14:46:40,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39371 states, 36922 states have (on average 1.5247548886842532) internal successors, (56297), 36970 states have internal predecessors, (56297), 2232 states have call successors, (2232), 216 states have call predecessors, (2232), 216 states have return successors, (2232), 2184 states have call predecessors, (2232), 2232 states have call successors, (2232) [2025-01-09 14:46:40,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39371 states to 39371 states and 60761 transitions. [2025-01-09 14:46:40,257 INFO L78 Accepts]: Start accepts. Automaton has 39371 states and 60761 transitions. Word has length 488 [2025-01-09 14:46:40,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:40,258 INFO L471 AbstractCegarLoop]: Abstraction has 39371 states and 60761 transitions. [2025-01-09 14:46:40,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:40,258 INFO L276 IsEmpty]: Start isEmpty. Operand 39371 states and 60761 transitions. [2025-01-09 14:46:40,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-01-09 14:46:40,425 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:40,425 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:40,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:46:40,425 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:40,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:40,426 INFO L85 PathProgramCache]: Analyzing trace with hash 302318172, now seen corresponding path program 1 times [2025-01-09 14:46:40,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:40,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685201893] [2025-01-09 14:46:40,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:40,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:40,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-01-09 14:46:40,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-01-09 14:46:40,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:40,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-01-09 14:46:40,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:40,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685201893] [2025-01-09 14:46:40,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685201893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:40,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:40,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:46:40,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742032409] [2025-01-09 14:46:40,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:40,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:46:40,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:40,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:46:40,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:46:40,747 INFO L87 Difference]: Start difference. First operand 39371 states and 60761 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:41,980 INFO L93 Difference]: Finished difference Result 95763 states and 147641 transitions. [2025-01-09 14:46:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:46:41,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 488 [2025-01-09 14:46:41,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:42,302 INFO L225 Difference]: With dead ends: 95763 [2025-01-09 14:46:42,303 INFO L226 Difference]: Without dead ends: 56395 [2025-01-09 14:46:42,368 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:46:42,374 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 366 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:42,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 809 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:46:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56395 states. [2025-01-09 14:46:44,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56395 to 54626. [2025-01-09 14:46:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54626 states, 50846 states have (on average 1.5018093852023757) internal successors, (76361), 50940 states have internal predecessors, (76361), 3404 states have call successors, (3404), 375 states have call predecessors, (3404), 375 states have return successors, (3404), 3310 states have call predecessors, (3404), 3404 states have call successors, (3404) [2025-01-09 14:46:44,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54626 states to 54626 states and 83169 transitions. [2025-01-09 14:46:44,890 INFO L78 Accepts]: Start accepts. Automaton has 54626 states and 83169 transitions. Word has length 488 [2025-01-09 14:46:44,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:44,891 INFO L471 AbstractCegarLoop]: Abstraction has 54626 states and 83169 transitions. [2025-01-09 14:46:44,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:44,891 INFO L276 IsEmpty]: Start isEmpty. Operand 54626 states and 83169 transitions. [2025-01-09 14:46:44,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-01-09 14:46:44,912 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:44,912 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:44,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:46:44,912 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:44,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:44,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1543048994, now seen corresponding path program 1 times [2025-01-09 14:46:44,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:44,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261433890] [2025-01-09 14:46:44,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:44,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:44,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-01-09 14:46:45,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-01-09 14:46:45,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:45,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:45,624 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-01-09 14:46:45,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:45,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261433890] [2025-01-09 14:46:45,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261433890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:45,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:45,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:46:45,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871660562] [2025-01-09 14:46:45,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:45,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:46:45,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:45,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:46:45,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:45,626 INFO L87 Difference]: Start difference. First operand 54626 states and 83169 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:48,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:48,572 INFO L93 Difference]: Finished difference Result 160978 states and 244000 transitions. [2025-01-09 14:46:48,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:46:48,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 488 [2025-01-09 14:46:48,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:48,814 INFO L225 Difference]: With dead ends: 160978 [2025-01-09 14:46:48,815 INFO L226 Difference]: Without dead ends: 106355 [2025-01-09 14:46:48,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:46:48,869 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 837 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:48,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 990 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:46:48,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106355 states. [2025-01-09 14:46:51,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106355 to 54922. [2025-01-09 14:46:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54922 states, 51142 states have (on average 1.5004692816080716) internal successors, (76737), 51236 states have internal predecessors, (76737), 3404 states have call successors, (3404), 375 states have call predecessors, (3404), 375 states have return successors, (3404), 3310 states have call predecessors, (3404), 3404 states have call successors, (3404) [2025-01-09 14:46:51,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54922 states to 54922 states and 83545 transitions. [2025-01-09 14:46:51,875 INFO L78 Accepts]: Start accepts. Automaton has 54922 states and 83545 transitions. Word has length 488 [2025-01-09 14:46:51,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:51,878 INFO L471 AbstractCegarLoop]: Abstraction has 54922 states and 83545 transitions. [2025-01-09 14:46:51,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:46:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 54922 states and 83545 transitions. [2025-01-09 14:46:51,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-01-09 14:46:51,919 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:51,919 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:51,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:46:51,920 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:51,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:51,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1081735010, now seen corresponding path program 1 times [2025-01-09 14:46:51,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:51,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262713738] [2025-01-09 14:46:51,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:51,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:51,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-01-09 14:46:53,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-01-09 14:46:53,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:53,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 24 proven. 186 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-01-09 14:46:53,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:53,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262713738] [2025-01-09 14:46:53,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262713738] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:46:53,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277348776] [2025-01-09 14:46:53,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:53,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:53,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:53,897 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:46:53,899 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:46:54,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-01-09 14:46:54,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-01-09 14:46:54,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:54,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:54,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 1172 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:46:54,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:46:54,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 2070 proven. 186 refuted. 0 times theorem prover too weak. 7684 trivial. 0 not checked. [2025-01-09 14:46:54,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:46:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 24 proven. 186 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-01-09 14:46:55,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277348776] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:46:55,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:46:55,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 14:46:55,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841119169] [2025-01-09 14:46:55,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:46:55,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:46:55,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:55,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:46:55,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:46:55,159 INFO L87 Difference]: Start difference. First operand 54922 states and 83545 transitions. Second operand has 8 states, 8 states have (on average 24.5) internal successors, (196), 8 states have internal predecessors, (196), 3 states have call successors, (195), 2 states have call predecessors, (195), 4 states have return successors, (196), 3 states have call predecessors, (196), 3 states have call successors, (196) [2025-01-09 14:46:56,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:56,386 INFO L93 Difference]: Finished difference Result 77907 states and 118392 transitions. [2025-01-09 14:46:56,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:46:56,387 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 24.5) internal successors, (196), 8 states have internal predecessors, (196), 3 states have call successors, (195), 2 states have call predecessors, (195), 4 states have return successors, (196), 3 states have call predecessors, (196), 3 states have call successors, (196) Word has length 488 [2025-01-09 14:46:56,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:56,454 INFO L225 Difference]: With dead ends: 77907 [2025-01-09 14:46:56,455 INFO L226 Difference]: Without dead ends: 22988 [2025-01-09 14:46:56,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 983 GetRequests, 974 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:46:56,522 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 243 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:56,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 889 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:46:56,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22988 states. [2025-01-09 14:46:57,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22988 to 22918. [2025-01-09 14:46:57,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22918 states, 21079 states have (on average 1.4883058968641776) internal successors, (31372), 21115 states have internal predecessors, (31372), 1614 states have call successors, (1614), 224 states have call predecessors, (1614), 224 states have return successors, (1614), 1578 states have call predecessors, (1614), 1614 states have call successors, (1614) [2025-01-09 14:46:57,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22918 states to 22918 states and 34600 transitions. [2025-01-09 14:46:57,494 INFO L78 Accepts]: Start accepts. Automaton has 22918 states and 34600 transitions. Word has length 488 [2025-01-09 14:46:57,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:57,495 INFO L471 AbstractCegarLoop]: Abstraction has 22918 states and 34600 transitions. [2025-01-09 14:46:57,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.5) internal successors, (196), 8 states have internal predecessors, (196), 3 states have call successors, (195), 2 states have call predecessors, (195), 4 states have return successors, (196), 3 states have call predecessors, (196), 3 states have call successors, (196) [2025-01-09 14:46:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 22918 states and 34600 transitions. [2025-01-09 14:46:57,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-01-09 14:46:57,506 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:57,506 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:57,535 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:46:57,709 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,SelfDestructingSolverStorable14 [2025-01-09 14:46:57,710 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:57,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:57,710 INFO L85 PathProgramCache]: Analyzing trace with hash -543552485, now seen corresponding path program 1 times [2025-01-09 14:46:57,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:57,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974371261] [2025-01-09 14:46:57,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:57,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:57,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-01-09 14:47:00,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-01-09 14:47:00,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:00,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:02,392 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 234 proven. 180 refuted. 0 times theorem prover too weak. 9526 trivial. 0 not checked. [2025-01-09 14:47:02,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:02,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974371261] [2025-01-09 14:47:02,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974371261] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:02,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404740880] [2025-01-09 14:47:02,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:02,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:02,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:02,400 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:47:02,405 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:47:02,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-01-09 14:47:02,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-01-09 14:47:02,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:02,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:02,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 14:47:02,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:04,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 6448 proven. 444 refuted. 0 times theorem prover too weak. 3048 trivial. 0 not checked. [2025-01-09 14:47:04,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:47:05,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 318 proven. 303 refuted. 0 times theorem prover too weak. 9319 trivial. 0 not checked. [2025-01-09 14:47:05,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404740880] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:47:05,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:47:05,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 13] total 33 [2025-01-09 14:47:05,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848354102] [2025-01-09 14:47:05,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:47:05,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 14:47:05,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:05,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 14:47:05,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=875, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 14:47:05,320 INFO L87 Difference]: Start difference. First operand 22918 states and 34600 transitions. Second operand has 33 states, 32 states have (on average 10.5) internal successors, (336), 30 states have internal predecessors, (336), 10 states have call successors, (179), 5 states have call predecessors, (179), 10 states have return successors, (181), 10 states have call predecessors, (181), 10 states have call successors, (181) [2025-01-09 14:47:15,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:15,367 INFO L93 Difference]: Finished difference Result 85267 states and 126527 transitions. [2025-01-09 14:47:15,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-01-09 14:47:15,368 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 10.5) internal successors, (336), 30 states have internal predecessors, (336), 10 states have call successors, (179), 5 states have call predecessors, (179), 10 states have return successors, (181), 10 states have call predecessors, (181), 10 states have call successors, (181) Word has length 489 [2025-01-09 14:47:15,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:15,469 INFO L225 Difference]: With dead ends: 85267 [2025-01-09 14:47:15,470 INFO L226 Difference]: Without dead ends: 62352 [2025-01-09 14:47:15,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1070 GetRequests, 967 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3158 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2426, Invalid=8494, Unknown=0, NotChecked=0, Total=10920 [2025-01-09 14:47:15,498 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 5816 mSDsluCounter, 2562 mSDsCounter, 0 mSdLazyCounter, 3171 mSolverCounterSat, 1093 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5816 SdHoareTripleChecker+Valid, 2885 SdHoareTripleChecker+Invalid, 4264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1093 IncrementalHoareTripleChecker+Valid, 3171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:15,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5816 Valid, 2885 Invalid, 4264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1093 Valid, 3171 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 14:47:15,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62352 states. [2025-01-09 14:47:17,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62352 to 31939. [2025-01-09 14:47:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31939 states, 30242 states have (on average 1.4757291184445473) internal successors, (44629), 30280 states have internal predecessors, (44629), 1402 states have call successors, (1402), 294 states have call predecessors, (1402), 294 states have return successors, (1402), 1364 states have call predecessors, (1402), 1402 states have call successors, (1402) [2025-01-09 14:47:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31939 states to 31939 states and 47433 transitions. [2025-01-09 14:47:17,402 INFO L78 Accepts]: Start accepts. Automaton has 31939 states and 47433 transitions. Word has length 489 [2025-01-09 14:47:17,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:17,403 INFO L471 AbstractCegarLoop]: Abstraction has 31939 states and 47433 transitions. [2025-01-09 14:47:17,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 10.5) internal successors, (336), 30 states have internal predecessors, (336), 10 states have call successors, (179), 5 states have call predecessors, (179), 10 states have return successors, (181), 10 states have call predecessors, (181), 10 states have call successors, (181) [2025-01-09 14:47:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand 31939 states and 47433 transitions. [2025-01-09 14:47:17,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2025-01-09 14:47:17,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:17,420 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,430 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:47:17,624 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,SelfDestructingSolverStorable15 [2025-01-09 14:47:17,624 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:17,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:17,625 INFO L85 PathProgramCache]: Analyzing trace with hash 450229842, now seen corresponding path program 1 times [2025-01-09 14:47:17,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:17,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181610367] [2025-01-09 14:47:17,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:17,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:17,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes. [2025-01-09 14:47:17,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements. [2025-01-09 14:47:17,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:17,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:18,277 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-01-09 14:47:18,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:18,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181610367] [2025-01-09 14:47:18,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181610367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:18,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:18,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:47:18,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729036473] [2025-01-09 14:47:18,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:18,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:47:18,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:18,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:47:18,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:18,279 INFO L87 Difference]: Start difference. First operand 31939 states and 47433 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:47:20,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:20,366 INFO L93 Difference]: Finished difference Result 85381 states and 126122 transitions. [2025-01-09 14:47:20,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:47:20,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 490 [2025-01-09 14:47:20,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:20,491 INFO L225 Difference]: With dead ends: 85381 [2025-01-09 14:47:20,496 INFO L226 Difference]: Without dead ends: 53445 [2025-01-09 14:47:20,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:20,549 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 325 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:20,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1127 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:47:20,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53445 states. [2025-01-09 14:47:22,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53445 to 46747. [2025-01-09 14:47:22,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46747 states, 44188 states have (on average 1.456006155517335) internal successors, (64338), 44246 states have internal predecessors, (64338), 2114 states have call successors, (2114), 444 states have call predecessors, (2114), 444 states have return successors, (2114), 2056 states have call predecessors, (2114), 2114 states have call successors, (2114) [2025-01-09 14:47:23,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46747 states to 46747 states and 68566 transitions. [2025-01-09 14:47:23,025 INFO L78 Accepts]: Start accepts. Automaton has 46747 states and 68566 transitions. Word has length 490 [2025-01-09 14:47:23,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:23,026 INFO L471 AbstractCegarLoop]: Abstraction has 46747 states and 68566 transitions. [2025-01-09 14:47:23,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 14:47:23,026 INFO L276 IsEmpty]: Start isEmpty. Operand 46747 states and 68566 transitions. [2025-01-09 14:47:23,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2025-01-09 14:47:23,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:23,044 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 14:47:23,045 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:23,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:23,046 INFO L85 PathProgramCache]: Analyzing trace with hash -921577456, now seen corresponding path program 1 times [2025-01-09 14:47:23,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:23,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043210302] [2025-01-09 14:47:23,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:23,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:23,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes. [2025-01-09 14:47:24,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements. [2025-01-09 14:47:24,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:24,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat