./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-27.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_amount250_file-27.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 cde063dcb13ed313b2f32e49cd3dc75da2c365cf6b52ae59dd9b17042beff0a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:21:47,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:21:47,250 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:21:47,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:21:47,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:21:47,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:21:47,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:21:47,282 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:21:47,283 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:21:47,283 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:21:47,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:21:47,283 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:21:47,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:21:47,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:21:47,283 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:21:47,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:21:47,284 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:21:47,284 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:21:47,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:21:47,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:21:47,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:21:47,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:21:47,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:21:47,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:21:47,285 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:21:47,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:21:47,286 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:21:47,286 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:21:47,286 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:21:47,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:21:47,286 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:21:47,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:21:47,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:21:47,286 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:21:47,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:21:47,286 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:21:47,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:21:47,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:21:47,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:21:47,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:21:47,287 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:21:47,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:21:47,287 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:21:47,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:21:47,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:21:47,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:21:47,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:21:47,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:21:47,288 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 -> cde063dcb13ed313b2f32e49cd3dc75da2c365cf6b52ae59dd9b17042beff0a8 [2025-01-09 14:21:47,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:21:47,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:21:47,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:21:47,536 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:21:47,536 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:21:47,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-27.i [2025-01-09 14:21:48,721 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f67774f4/5c7939b1bce545b589f4043f3da873a8/FLAG5bdedbb87 [2025-01-09 14:21:49,014 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:21:49,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-27.i [2025-01-09 14:21:49,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f67774f4/5c7939b1bce545b589f4043f3da873a8/FLAG5bdedbb87 [2025-01-09 14:21:49,291 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f67774f4/5c7939b1bce545b589f4043f3da873a8 [2025-01-09 14:21:49,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:21:49,293 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:21:49,294 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:21:49,294 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:21:49,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:21:49,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:21:49" (1/1) ... [2025-01-09 14:21:49,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef9a0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:49, skipping insertion in model container [2025-01-09 14:21:49,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:21:49" (1/1) ... [2025-01-09 14:21:49,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:21:49,421 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_amount250_file-27.i[916,929] [2025-01-09 14:21:49,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:21:49,547 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:21:49,554 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_amount250_file-27.i[916,929] [2025-01-09 14:21:49,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:21:49,639 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:21:49,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:49 WrapperNode [2025-01-09 14:21:49,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:21:49,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:21:49,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:21:49,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:21:49,646 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:21:49" (1/1) ... [2025-01-09 14:21:49,654 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:21:49" (1/1) ... [2025-01-09 14:21:49,682 INFO L138 Inliner]: procedures = 26, calls = 64, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 450 [2025-01-09 14:21:49,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:21:49,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:21:49,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:21:49,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:21:49,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:49" (1/1) ... [2025-01-09 14:21:49,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:49" (1/1) ... [2025-01-09 14:21:49,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:49" (1/1) ... [2025-01-09 14:21:49,710 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:21:49,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:49" (1/1) ... [2025-01-09 14:21:49,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:49" (1/1) ... [2025-01-09 14:21:49,721 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:49" (1/1) ... [2025-01-09 14:21:49,723 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:49" (1/1) ... [2025-01-09 14:21:49,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:49" (1/1) ... [2025-01-09 14:21:49,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:49" (1/1) ... [2025-01-09 14:21:49,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:49" (1/1) ... [2025-01-09 14:21:49,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:21:49,737 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:21:49,737 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:21:49,737 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:21:49,737 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:49" (1/1) ... [2025-01-09 14:21:49,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:21:49,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:21:49,761 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:21:49,765 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:21:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:21:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:21:49,777 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:21:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:21:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:21:49,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:21:49,854 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:21:49,859 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:21:50,475 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-01-09 14:21:50,475 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:21:50,490 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:21:50,490 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:21:50,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:21:50 BoogieIcfgContainer [2025-01-09 14:21:50,490 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:21:50,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:21:50,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:21:50,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:21:50,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:21:49" (1/3) ... [2025-01-09 14:21:50,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b8d02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:21:50, skipping insertion in model container [2025-01-09 14:21:50,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:49" (2/3) ... [2025-01-09 14:21:50,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b8d02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:21:50, skipping insertion in model container [2025-01-09 14:21:50,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:21:50" (3/3) ... [2025-01-09 14:21:50,498 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-27.i [2025-01-09 14:21:50,508 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:21:50,512 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-27.i that has 2 procedures, 189 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:21:50,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:21:50,567 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;@4fe82ecc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:21:50,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:21:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 135 states have (on average 1.4962962962962962) internal successors, (202), 136 states have internal predecessors, (202), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 14:21:50,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-01-09 14:21:50,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:50,590 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:50,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:50,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:50,595 INFO L85 PathProgramCache]: Analyzing trace with hash 2068051553, now seen corresponding path program 1 times [2025-01-09 14:21:50,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:50,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632698668] [2025-01-09 14:21:50,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:50,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:50,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-01-09 14:21:50,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-01-09 14:21:50,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:50,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:50,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-01-09 14:21:50,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:50,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632698668] [2025-01-09 14:21:50,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632698668] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:21:50,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400688925] [2025-01-09 14:21:50,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:50,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:21:50,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:21:50,989 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:21:50,990 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:21:51,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-01-09 14:21:51,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-01-09 14:21:51,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:51,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:51,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:21:51,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:21:51,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-01-09 14:21:51,287 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:21:51,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400688925] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:51,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:21:51,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:21:51,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273453116] [2025-01-09 14:21:51,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:51,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:21:51,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:51,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:21:51,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:21:51,311 INFO L87 Difference]: Start difference. First operand has 189 states, 135 states have (on average 1.4962962962962962) internal successors, (202), 136 states have internal predecessors, (202), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-01-09 14:21:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:51,355 INFO L93 Difference]: Finished difference Result 371 states and 652 transitions. [2025-01-09 14:21:51,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:21:51,356 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) Word has length 340 [2025-01-09 14:21:51,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:51,361 INFO L225 Difference]: With dead ends: 371 [2025-01-09 14:21:51,362 INFO L226 Difference]: Without dead ends: 185 [2025-01-09 14:21:51,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 341 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:21:51,369 INFO L435 NwaCegarLoop]: 295 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, 295 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:21:51,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:21:51,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-09 14:21:51,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-01-09 14:21:51,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 132 states have (on average 1.4621212121212122) internal successors, (193), 132 states have internal predecessors, (193), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 14:21:51,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 295 transitions. [2025-01-09 14:21:51,420 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 295 transitions. Word has length 340 [2025-01-09 14:21:51,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:51,420 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 295 transitions. [2025-01-09 14:21:51,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-01-09 14:21:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 295 transitions. [2025-01-09 14:21:51,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-01-09 14:21:51,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:51,424 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:51,432 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:21:51,625 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:21:51,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:51,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:51,626 INFO L85 PathProgramCache]: Analyzing trace with hash -768723832, now seen corresponding path program 1 times [2025-01-09 14:21:51,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:51,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417349652] [2025-01-09 14:21:51,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:51,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:51,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-01-09 14:21:51,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-01-09 14:21:51,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:51,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-01-09 14:21:52,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:52,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417349652] [2025-01-09 14:21:52,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417349652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:52,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:52,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:21:52,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488282965] [2025-01-09 14:21:52,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:52,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:21:52,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:52,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:21:52,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:21:52,446 INFO L87 Difference]: Start difference. First operand 185 states and 295 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:53,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:53,060 INFO L93 Difference]: Finished difference Result 717 states and 1143 transitions. [2025-01-09 14:21:53,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:21:53,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 341 [2025-01-09 14:21:53,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:53,069 INFO L225 Difference]: With dead ends: 717 [2025-01-09 14:21:53,069 INFO L226 Difference]: Without dead ends: 535 [2025-01-09 14:21:53,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:21:53,071 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 519 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:53,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 1434 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:21:53,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-01-09 14:21:53,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 401. [2025-01-09 14:21:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 296 states have (on average 1.462837837837838) internal successors, (433), 296 states have internal predecessors, (433), 102 states have call successors, (102), 2 states have call predecessors, (102), 2 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 14:21:53,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 637 transitions. [2025-01-09 14:21:53,132 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 637 transitions. Word has length 341 [2025-01-09 14:21:53,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:53,133 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 637 transitions. [2025-01-09 14:21:53,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:53,133 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 637 transitions. [2025-01-09 14:21:53,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-01-09 14:21:53,138 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:53,139 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:53,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:21:53,139 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:53,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:53,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1798083130, now seen corresponding path program 1 times [2025-01-09 14:21:53,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:53,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207529142] [2025-01-09 14:21:53,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:53,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:53,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-01-09 14:21:53,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-01-09 14:21:53,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:53,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:53,931 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-01-09 14:21:53,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:53,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207529142] [2025-01-09 14:21:53,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207529142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:53,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:53,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:21:53,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180620069] [2025-01-09 14:21:53,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:53,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:21:53,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:53,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:21:53,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:21:53,933 INFO L87 Difference]: Start difference. First operand 401 states and 637 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:54,277 INFO L93 Difference]: Finished difference Result 1307 states and 2072 transitions. [2025-01-09 14:21:54,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:21:54,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 341 [2025-01-09 14:21:54,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:54,282 INFO L225 Difference]: With dead ends: 1307 [2025-01-09 14:21:54,283 INFO L226 Difference]: Without dead ends: 909 [2025-01-09 14:21:54,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:21:54,284 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 378 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:54,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1033 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:21:54,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-01-09 14:21:54,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 746. [2025-01-09 14:21:54,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 579 states have (on average 1.4905008635578583) internal successors, (863), 581 states have internal predecessors, (863), 162 states have call successors, (162), 4 states have call predecessors, (162), 4 states have return successors, (162), 160 states have call predecessors, (162), 162 states have call successors, (162) [2025-01-09 14:21:54,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1187 transitions. [2025-01-09 14:21:54,360 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1187 transitions. Word has length 341 [2025-01-09 14:21:54,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:54,361 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1187 transitions. [2025-01-09 14:21:54,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:54,361 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1187 transitions. [2025-01-09 14:21:54,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-01-09 14:21:54,364 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:54,364 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:54,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:21:54,365 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:54,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:54,365 INFO L85 PathProgramCache]: Analyzing trace with hash -985940280, now seen corresponding path program 1 times [2025-01-09 14:21:54,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:54,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665437088] [2025-01-09 14:21:54,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:54,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:54,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-09 14:21:54,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-09 14:21:54,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:54,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-01-09 14:21:55,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:55,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665437088] [2025-01-09 14:21:55,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665437088] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:55,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:55,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:21:55,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884996918] [2025-01-09 14:21:55,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:55,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:21:55,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:55,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:21:55,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:21:55,284 INFO L87 Difference]: Start difference. First operand 746 states and 1187 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:55,488 INFO L93 Difference]: Finished difference Result 1448 states and 2303 transitions. [2025-01-09 14:21:55,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:21:55,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 342 [2025-01-09 14:21:55,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:55,495 INFO L225 Difference]: With dead ends: 1448 [2025-01-09 14:21:55,495 INFO L226 Difference]: Without dead ends: 705 [2025-01-09 14:21:55,497 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:21:55,497 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 244 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:55,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 731 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:21:55,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-01-09 14:21:55,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 680. [2025-01-09 14:21:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 513 states have (on average 1.4736842105263157) internal successors, (756), 515 states have internal predecessors, (756), 162 states have call successors, (162), 4 states have call predecessors, (162), 4 states have return successors, (162), 160 states have call predecessors, (162), 162 states have call successors, (162) [2025-01-09 14:21:55,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1080 transitions. [2025-01-09 14:21:55,573 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1080 transitions. Word has length 342 [2025-01-09 14:21:55,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:55,573 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 1080 transitions. [2025-01-09 14:21:55,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:55,574 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1080 transitions. [2025-01-09 14:21:55,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-01-09 14:21:55,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:55,577 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:55,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:21:55,577 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:55,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:55,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1463659850, now seen corresponding path program 1 times [2025-01-09 14:21:55,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:55,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116060849] [2025-01-09 14:21:55,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:55,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:55,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-09 14:21:55,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-09 14:21:55,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:55,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-01-09 14:21:56,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:56,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116060849] [2025-01-09 14:21:56,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116060849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:56,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:56,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:21:56,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443568554] [2025-01-09 14:21:56,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:56,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:21:56,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:56,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:21:56,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:21:56,171 INFO L87 Difference]: Start difference. First operand 680 states and 1080 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:56,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:56,651 INFO L93 Difference]: Finished difference Result 1782 states and 2813 transitions. [2025-01-09 14:21:56,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:21:56,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 342 [2025-01-09 14:21:56,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:56,659 INFO L225 Difference]: With dead ends: 1782 [2025-01-09 14:21:56,659 INFO L226 Difference]: Without dead ends: 1105 [2025-01-09 14:21:56,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:21:56,661 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 465 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:56,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 773 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:21:56,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2025-01-09 14:21:56,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 731. [2025-01-09 14:21:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 562 states have (on average 1.4501779359430604) internal successors, (815), 564 states have internal predecessors, (815), 162 states have call successors, (162), 6 states have call predecessors, (162), 6 states have return successors, (162), 160 states have call predecessors, (162), 162 states have call successors, (162) [2025-01-09 14:21:56,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1139 transitions. [2025-01-09 14:21:56,744 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1139 transitions. Word has length 342 [2025-01-09 14:21:56,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:56,744 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 1139 transitions. [2025-01-09 14:21:56,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1139 transitions. [2025-01-09 14:21:56,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-01-09 14:21:56,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:56,747 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:56,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:21:56,748 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:56,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:56,748 INFO L85 PathProgramCache]: Analyzing trace with hash 256527759, now seen corresponding path program 1 times [2025-01-09 14:21:56,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:56,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834727417] [2025-01-09 14:21:56,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:56,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:56,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-09 14:21:57,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-09 14:21:57,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:57,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:57,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 87 proven. 207 refuted. 0 times theorem prover too weak. 4806 trivial. 0 not checked. [2025-01-09 14:21:57,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:57,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834727417] [2025-01-09 14:21:57,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834727417] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:21:57,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862418237] [2025-01-09 14:21:57,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:57,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:21:57,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:21:57,621 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:21:57,622 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:21:57,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-09 14:21:57,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-09 14:21:57,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:57,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:57,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 14:21:57,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:21:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 3155 proven. 192 refuted. 0 times theorem prover too weak. 1753 trivial. 0 not checked. [2025-01-09 14:21:58,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:21:59,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 102 proven. 195 refuted. 0 times theorem prover too weak. 4803 trivial. 0 not checked. [2025-01-09 14:21:59,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862418237] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:21:59,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:21:59,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 19 [2025-01-09 14:21:59,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142400592] [2025-01-09 14:21:59,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:21:59,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 14:21:59,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:59,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 14:21:59,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-01-09 14:21:59,106 INFO L87 Difference]: Start difference. First operand 731 states and 1139 transitions. Second operand has 19 states, 19 states have (on average 12.473684210526315) internal successors, (237), 19 states have internal predecessors, (237), 7 states have call successors, (133), 3 states have call predecessors, (133), 7 states have return successors, (135), 7 states have call predecessors, (135), 7 states have call successors, (135) [2025-01-09 14:22:00,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:00,217 INFO L93 Difference]: Finished difference Result 2011 states and 3070 transitions. [2025-01-09 14:22:00,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 14:22:00,217 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.473684210526315) internal successors, (237), 19 states have internal predecessors, (237), 7 states have call successors, (133), 3 states have call predecessors, (133), 7 states have return successors, (135), 7 states have call predecessors, (135), 7 states have call successors, (135) Word has length 343 [2025-01-09 14:22:00,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:00,223 INFO L225 Difference]: With dead ends: 2011 [2025-01-09 14:22:00,223 INFO L226 Difference]: Without dead ends: 1283 [2025-01-09 14:22:00,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 680 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=477, Invalid=1245, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 14:22:00,226 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 1847 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1847 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:00,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1847 Valid, 1055 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:22:00,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2025-01-09 14:22:00,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1265. [2025-01-09 14:22:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1044 states have (on average 1.4348659003831417) internal successors, (1498), 1050 states have internal predecessors, (1498), 194 states have call successors, (194), 26 states have call predecessors, (194), 26 states have return successors, (194), 188 states have call predecessors, (194), 194 states have call successors, (194) [2025-01-09 14:22:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1886 transitions. [2025-01-09 14:22:00,299 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1886 transitions. Word has length 343 [2025-01-09 14:22:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:00,300 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1886 transitions. [2025-01-09 14:22:00,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.473684210526315) internal successors, (237), 19 states have internal predecessors, (237), 7 states have call successors, (133), 3 states have call predecessors, (133), 7 states have return successors, (135), 7 states have call predecessors, (135), 7 states have call successors, (135) [2025-01-09 14:22:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1886 transitions. [2025-01-09 14:22:00,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-01-09 14:22:00,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:00,304 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:00,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 14:22:00,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:22:00,505 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:00,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:00,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1913313910, now seen corresponding path program 1 times [2025-01-09 14:22:00,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:00,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166706217] [2025-01-09 14:22:00,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:00,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:00,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-01-09 14:22:00,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-01-09 14:22:00,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:00,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 108 proven. 42 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2025-01-09 14:22:02,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:02,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166706217] [2025-01-09 14:22:02,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166706217] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:22:02,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824746589] [2025-01-09 14:22:02,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:02,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:22:02,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:22:02,820 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:22:02,822 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:22:02,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-01-09 14:22:03,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-01-09 14:22:03,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:03,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:03,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-01-09 14:22:03,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:22:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 3884 proven. 444 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2025-01-09 14:22:06,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:22:23,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824746589] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:22:23,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:22:23,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 28] total 39 [2025-01-09 14:22:23,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711823852] [2025-01-09 14:22:23,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:22:23,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 14:22:23,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:23,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 14:22:23,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2268, Unknown=2, NotChecked=0, Total=2652 [2025-01-09 14:22:23,623 INFO L87 Difference]: Start difference. First operand 1265 states and 1886 transitions. Second operand has 39 states, 39 states have (on average 5.153846153846154) internal successors, (201), 38 states have internal predecessors, (201), 9 states have call successors, (102), 8 states have call predecessors, (102), 14 states have return successors, (102), 9 states have call predecessors, (102), 9 states have call successors, (102) [2025-01-09 14:22:35,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:35,376 INFO L93 Difference]: Finished difference Result 10533 states and 15365 transitions. [2025-01-09 14:22:35,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2025-01-09 14:22:35,376 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 5.153846153846154) internal successors, (201), 38 states have internal predecessors, (201), 9 states have call successors, (102), 8 states have call predecessors, (102), 14 states have return successors, (102), 9 states have call predecessors, (102), 9 states have call successors, (102) Word has length 345 [2025-01-09 14:22:35,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:35,407 INFO L225 Difference]: With dead ends: 10533 [2025-01-09 14:22:35,407 INFO L226 Difference]: Without dead ends: 9271 [2025-01-09 14:22:35,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12042 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=6225, Invalid=30063, Unknown=2, NotChecked=0, Total=36290 [2025-01-09 14:22:35,417 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 3353 mSDsluCounter, 4177 mSDsCounter, 0 mSdLazyCounter, 7164 mSolverCounterSat, 803 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3372 SdHoareTripleChecker+Valid, 4503 SdHoareTripleChecker+Invalid, 7967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 803 IncrementalHoareTripleChecker+Valid, 7164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:35,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3372 Valid, 4503 Invalid, 7967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [803 Valid, 7164 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-01-09 14:22:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9271 states. [2025-01-09 14:22:35,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9271 to 6677. [2025-01-09 14:22:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6677 states, 5716 states have (on average 1.4268719384184745) internal successors, (8156), 5746 states have internal predecessors, (8156), 768 states have call successors, (768), 192 states have call predecessors, (768), 192 states have return successors, (768), 738 states have call predecessors, (768), 768 states have call successors, (768) [2025-01-09 14:22:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6677 states to 6677 states and 9692 transitions. [2025-01-09 14:22:35,986 INFO L78 Accepts]: Start accepts. Automaton has 6677 states and 9692 transitions. Word has length 345 [2025-01-09 14:22:35,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:35,988 INFO L471 AbstractCegarLoop]: Abstraction has 6677 states and 9692 transitions. [2025-01-09 14:22:35,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.153846153846154) internal successors, (201), 38 states have internal predecessors, (201), 9 states have call successors, (102), 8 states have call predecessors, (102), 14 states have return successors, (102), 9 states have call predecessors, (102), 9 states have call successors, (102) [2025-01-09 14:22:35,988 INFO L276 IsEmpty]: Start isEmpty. Operand 6677 states and 9692 transitions. [2025-01-09 14:22:35,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-01-09 14:22:35,997 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:35,998 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:36,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:22:36,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:22:36,198 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:36,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:36,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1872180296, now seen corresponding path program 1 times [2025-01-09 14:22:36,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:36,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807023581] [2025-01-09 14:22:36,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:36,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:36,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-01-09 14:22:36,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-01-09 14:22:36,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:36,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 183 proven. 111 refuted. 0 times theorem prover too weak. 4806 trivial. 0 not checked. [2025-01-09 14:22:37,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:37,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807023581] [2025-01-09 14:22:37,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807023581] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:22:37,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581934322] [2025-01-09 14:22:37,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:37,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:22:37,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:22:37,798 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:22:37,799 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:22:37,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-01-09 14:22:37,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-01-09 14:22:37,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:37,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:37,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 14:22:37,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:22:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 3746 proven. 297 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [2025-01-09 14:22:41,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:22:44,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 393 proven. 327 refuted. 0 times theorem prover too weak. 4380 trivial. 0 not checked. [2025-01-09 14:22:44,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581934322] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:22:44,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:22:44,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 22] total 52 [2025-01-09 14:22:44,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24471255] [2025-01-09 14:22:44,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:22:44,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-01-09 14:22:44,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:44,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-01-09 14:22:44,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=2197, Unknown=0, NotChecked=0, Total=2652 [2025-01-09 14:22:44,375 INFO L87 Difference]: Start difference. First operand 6677 states and 9692 transitions. Second operand has 52 states, 50 states have (on average 5.66) internal successors, (283), 48 states have internal predecessors, (283), 15 states have call successors, (153), 7 states have call predecessors, (153), 16 states have return successors, (153), 15 states have call predecessors, (153), 15 states have call successors, (153) [2025-01-09 14:23:04,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:23:04,977 INFO L93 Difference]: Finished difference Result 33254 states and 48457 transitions. [2025-01-09 14:23:04,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2025-01-09 14:23:04,978 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 5.66) internal successors, (283), 48 states have internal predecessors, (283), 15 states have call successors, (153), 7 states have call predecessors, (153), 16 states have return successors, (153), 15 states have call predecessors, (153), 15 states have call successors, (153) Word has length 345 [2025-01-09 14:23:04,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:23:05,053 INFO L225 Difference]: With dead ends: 33254 [2025-01-09 14:23:05,053 INFO L226 Difference]: Without dead ends: 26580 [2025-01-09 14:23:05,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 674 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7411 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=4059, Invalid=17993, Unknown=0, NotChecked=0, Total=22052 [2025-01-09 14:23:05,069 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 6855 mSDsluCounter, 5992 mSDsCounter, 0 mSdLazyCounter, 8870 mSolverCounterSat, 2013 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6882 SdHoareTripleChecker+Valid, 6302 SdHoareTripleChecker+Invalid, 10883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2013 IncrementalHoareTripleChecker+Valid, 8870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:23:05,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6882 Valid, 6302 Invalid, 10883 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2013 Valid, 8870 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2025-01-09 14:23:05,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26580 states. [2025-01-09 14:23:06,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26580 to 13377. [2025-01-09 14:23:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13377 states, 11615 states have (on average 1.4377959535083944) internal successors, (16700), 11663 states have internal predecessors, (16700), 1413 states have call successors, (1413), 348 states have call predecessors, (1413), 348 states have return successors, (1413), 1365 states have call predecessors, (1413), 1413 states have call successors, (1413) [2025-01-09 14:23:06,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13377 states to 13377 states and 19526 transitions. [2025-01-09 14:23:06,321 INFO L78 Accepts]: Start accepts. Automaton has 13377 states and 19526 transitions. Word has length 345 [2025-01-09 14:23:06,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:23:06,322 INFO L471 AbstractCegarLoop]: Abstraction has 13377 states and 19526 transitions. [2025-01-09 14:23:06,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 5.66) internal successors, (283), 48 states have internal predecessors, (283), 15 states have call successors, (153), 7 states have call predecessors, (153), 16 states have return successors, (153), 15 states have call predecessors, (153), 15 states have call successors, (153) [2025-01-09 14:23:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 13377 states and 19526 transitions. [2025-01-09 14:23:06,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-01-09 14:23:06,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:23:06,337 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:06,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 14:23:06,537 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,SelfDestructingSolverStorable7 [2025-01-09 14:23:06,538 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:23:06,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:23:06,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1890681656, now seen corresponding path program 1 times [2025-01-09 14:23:06,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:23:06,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533625225] [2025-01-09 14:23:06,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:23:06,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:23:06,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-01-09 14:23:06,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-01-09 14:23:06,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:23:06,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:23:07,933 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 156 proven. 138 refuted. 0 times theorem prover too weak. 4806 trivial. 0 not checked. [2025-01-09 14:23:07,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:23:07,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533625225] [2025-01-09 14:23:07,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533625225] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:23:07,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400013822] [2025-01-09 14:23:07,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:23:07,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:23:07,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:23:07,939 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:23:07,944 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:23:08,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-01-09 14:23:08,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-01-09 14:23:08,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:23:08,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:23:08,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 14:23:08,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:23:10,407 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 3426 proven. 171 refuted. 0 times theorem prover too weak. 1503 trivial. 0 not checked. [2025-01-09 14:23:10,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:23:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 261 proven. 180 refuted. 0 times theorem prover too weak. 4659 trivial. 0 not checked. [2025-01-09 14:23:12,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400013822] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:23:12,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:23:12,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 36 [2025-01-09 14:23:12,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354668558] [2025-01-09 14:23:12,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:23:12,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-09 14:23:12,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:23:12,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-09 14:23:12,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1012, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 14:23:12,623 INFO L87 Difference]: Start difference. First operand 13377 states and 19526 transitions. Second operand has 36 states, 35 states have (on average 7.257142857142857) internal successors, (254), 34 states have internal predecessors, (254), 9 states have call successors, (153), 5 states have call predecessors, (153), 11 states have return successors, (153), 9 states have call predecessors, (153), 9 states have call successors, (153)