./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-89.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_amount100_file-89.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 0b29ac98a85c5671f74af5656694b90e325003b38bb486d3b8562135cfd086b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:13:13,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:13:13,771 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:13:13,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:13:13,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:13:13,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:13:13,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:13:13,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:13:13,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:13:13,796 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:13:13,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:13:13,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:13:13,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:13:13,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:13:13,797 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:13:13,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:13:13,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:13:13,798 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:13:13,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:13:13,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:13:13,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:13:13,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:13:13,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:13:13,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:13:13,798 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:13:13,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:13:13,798 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:13:13,798 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:13:13,799 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:13:13,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:13:13,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:13:13,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:13:13,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:13:13,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:13:13,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:13:13,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:13:13,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:13:13,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:13:13,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:13:13,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:13:13,800 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:13:13,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:13:13,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:13:13,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:13:13,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:13:13,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:13:13,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:13:13,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:13:13,801 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 -> 0b29ac98a85c5671f74af5656694b90e325003b38bb486d3b8562135cfd086b0 [2025-01-09 14:13:14,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:13:14,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:13:14,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:13:14,044 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:13:14,045 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:13:14,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-89.i [2025-01-09 14:13:15,180 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3423db60c/76e7dc870a6c42238b5c5ac17489d0fb/FLAG4eabf436a [2025-01-09 14:13:15,469 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:13:15,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-89.i [2025-01-09 14:13:15,481 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3423db60c/76e7dc870a6c42238b5c5ac17489d0fb/FLAG4eabf436a [2025-01-09 14:13:15,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3423db60c/76e7dc870a6c42238b5c5ac17489d0fb [2025-01-09 14:13:15,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:13:15,499 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:13:15,500 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:13:15,500 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:13:15,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:13:15,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:13:15" (1/1) ... [2025-01-09 14:13:15,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f13f7ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:15, skipping insertion in model container [2025-01-09 14:13:15,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:13:15" (1/1) ... [2025-01-09 14:13:15,524 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:13:15,627 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_amount100_file-89.i[916,929] [2025-01-09 14:13:15,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:13:15,728 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:13:15,736 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_amount100_file-89.i[916,929] [2025-01-09 14:13:15,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:13:15,773 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:13:15,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:15 WrapperNode [2025-01-09 14:13:15,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:13:15,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:13:15,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:13:15,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:13:15,779 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:13:15" (1/1) ... [2025-01-09 14:13:15,787 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:13:15" (1/1) ... [2025-01-09 14:13:15,823 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 261 [2025-01-09 14:13:15,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:13:15,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:13:15,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:13:15,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:13:15,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:15" (1/1) ... [2025-01-09 14:13:15,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:15" (1/1) ... [2025-01-09 14:13:15,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:15" (1/1) ... [2025-01-09 14:13:15,859 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:13:15,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:15" (1/1) ... [2025-01-09 14:13:15,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:15" (1/1) ... [2025-01-09 14:13:15,874 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:15" (1/1) ... [2025-01-09 14:13:15,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:15" (1/1) ... [2025-01-09 14:13:15,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:15" (1/1) ... [2025-01-09 14:13:15,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:15" (1/1) ... [2025-01-09 14:13:15,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:15" (1/1) ... [2025-01-09 14:13:15,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:13:15,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:13:15,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:13:15,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:13:15,898 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:15" (1/1) ... [2025-01-09 14:13:15,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:13:15,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:13:15,926 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:13:15,929 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:13:15,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:13:15,947 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:13:15,947 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:13:15,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:13:15,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:13:15,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:13:16,026 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:13:16,027 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:13:16,522 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-01-09 14:13:16,523 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:13:16,535 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:13:16,535 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:13:16,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:13:16 BoogieIcfgContainer [2025-01-09 14:13:16,536 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:13:16,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:13:16,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:13:16,541 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:13:16,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:13:15" (1/3) ... [2025-01-09 14:13:16,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3022e5cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:13:16, skipping insertion in model container [2025-01-09 14:13:16,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:15" (2/3) ... [2025-01-09 14:13:16,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3022e5cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:13:16, skipping insertion in model container [2025-01-09 14:13:16,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:13:16" (3/3) ... [2025-01-09 14:13:16,544 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-89.i [2025-01-09 14:13:16,557 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:13:16,560 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-89.i that has 2 procedures, 116 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:13:16,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:13:16,618 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;@50f51ae2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:13:16,619 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:13:16,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 76 states have internal predecessors, (106), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 14:13:16,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-01-09 14:13:16,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:13:16,638 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:16,639 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:13:16,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:13:16,644 INFO L85 PathProgramCache]: Analyzing trace with hash -263360840, now seen corresponding path program 1 times [2025-01-09 14:13:16,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:13:16,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742934984] [2025-01-09 14:13:16,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:13:16,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:13:16,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-09 14:13:16,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-09 14:13:16,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:13:16,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:13:17,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2025-01-09 14:13:17,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:13:17,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742934984] [2025-01-09 14:13:17,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742934984] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:13:17,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981394511] [2025-01-09 14:13:17,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:13:17,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:13:17,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:13:17,033 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:13:17,037 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:13:17,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-09 14:13:17,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-09 14:13:17,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:13:17,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:13:17,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:13:17,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:13:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2025-01-09 14:13:17,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:13:17,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981394511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:13:17,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:13:17,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:13:17,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524706959] [2025-01-09 14:13:17,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:13:17,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:13:17,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:13:17,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:13:17,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:13:17,246 INFO L87 Difference]: Start difference. First operand has 116 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 76 states have internal predecessors, (106), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2025-01-09 14:13:17,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:13:17,278 INFO L93 Difference]: Finished difference Result 226 states and 397 transitions. [2025-01-09 14:13:17,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:13:17,300 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) Word has length 238 [2025-01-09 14:13:17,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:13:17,307 INFO L225 Difference]: With dead ends: 226 [2025-01-09 14:13:17,308 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 14:13:17,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 239 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:13:17,312 INFO L435 NwaCegarLoop]: 175 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, 175 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:13:17,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:13:17,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 14:13:17,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-01-09 14:13:17,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 14:13:17,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 175 transitions. [2025-01-09 14:13:17,359 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 175 transitions. Word has length 238 [2025-01-09 14:13:17,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:13:17,361 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 175 transitions. [2025-01-09 14:13:17,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2025-01-09 14:13:17,361 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 175 transitions. [2025-01-09 14:13:17,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-01-09 14:13:17,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:13:17,366 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:17,375 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:13:17,571 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:13:17,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:13:17,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:13:17,572 INFO L85 PathProgramCache]: Analyzing trace with hash -258787660, now seen corresponding path program 1 times [2025-01-09 14:13:17,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:13:17,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862700802] [2025-01-09 14:13:17,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:13:17,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:13:17,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-09 14:13:17,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-09 14:13:17,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:13:17,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:13:18,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-01-09 14:13:18,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:13:18,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862700802] [2025-01-09 14:13:18,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862700802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:13:18,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:13:18,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:13:18,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205309911] [2025-01-09 14:13:18,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:13:18,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:13:18,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:13:18,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:13:18,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:13:18,822 INFO L87 Difference]: Start difference. First operand 113 states and 175 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:13:19,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:13:19,626 INFO L93 Difference]: Finished difference Result 392 states and 595 transitions. [2025-01-09 14:13:19,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:13:19,627 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 238 [2025-01-09 14:13:19,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:13:19,630 INFO L225 Difference]: With dead ends: 392 [2025-01-09 14:13:19,633 INFO L226 Difference]: Without dead ends: 282 [2025-01-09 14:13:19,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:13:19,636 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 258 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:13:19,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 957 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:13:19,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-01-09 14:13:19,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 161. [2025-01-09 14:13:19,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 121 states have (on average 1.4132231404958677) internal successors, (171), 121 states have internal predecessors, (171), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 14:13:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 247 transitions. [2025-01-09 14:13:19,664 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 247 transitions. Word has length 238 [2025-01-09 14:13:19,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:13:19,665 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 247 transitions. [2025-01-09 14:13:19,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:13:19,666 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 247 transitions. [2025-01-09 14:13:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-01-09 14:13:19,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:13:19,669 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:19,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:13:19,670 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:13:19,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:13:19,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1488759628, now seen corresponding path program 1 times [2025-01-09 14:13:19,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:13:19,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956109950] [2025-01-09 14:13:19,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:13:19,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:13:19,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-09 14:13:19,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-09 14:13:19,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:13:19,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:13:20,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-01-09 14:13:20,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:13:20,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956109950] [2025-01-09 14:13:20,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956109950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:13:20,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:13:20,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:13:20,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318735092] [2025-01-09 14:13:20,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:13:20,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:13:20,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:13:20,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:13:20,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:13:20,205 INFO L87 Difference]: Start difference. First operand 161 states and 247 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:13:20,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:13:20,352 INFO L93 Difference]: Finished difference Result 372 states and 566 transitions. [2025-01-09 14:13:20,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:13:20,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 238 [2025-01-09 14:13:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:13:20,366 INFO L225 Difference]: With dead ends: 372 [2025-01-09 14:13:20,366 INFO L226 Difference]: Without dead ends: 214 [2025-01-09 14:13:20,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:13:20,367 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 230 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:13:20,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 387 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:13:20,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-01-09 14:13:20,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 165. [2025-01-09 14:13:20,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 124 states have (on average 1.346774193548387) internal successors, (167), 124 states have internal predecessors, (167), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 14:13:20,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2025-01-09 14:13:20,389 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 238 [2025-01-09 14:13:20,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:13:20,389 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2025-01-09 14:13:20,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:13:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2025-01-09 14:13:20,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-01-09 14:13:20,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:13:20,394 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:20,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:13:20,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:13:20,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:13:20,395 INFO L85 PathProgramCache]: Analyzing trace with hash -951252571, now seen corresponding path program 1 times [2025-01-09 14:13:20,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:13:20,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382598938] [2025-01-09 14:13:20,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:13:20,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:13:20,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-01-09 14:13:20,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-01-09 14:13:20,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:13:20,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:13:20,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-01-09 14:13:20,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:13:20,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382598938] [2025-01-09 14:13:20,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382598938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:13:20,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:13:20,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:13:20,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528208483] [2025-01-09 14:13:20,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:13:20,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:13:20,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:13:20,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:13:20,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:13:20,644 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:13:21,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:13:21,006 INFO L93 Difference]: Finished difference Result 547 states and 811 transitions. [2025-01-09 14:13:21,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:13:21,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 239 [2025-01-09 14:13:21,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:13:21,011 INFO L225 Difference]: With dead ends: 547 [2025-01-09 14:13:21,011 INFO L226 Difference]: Without dead ends: 385 [2025-01-09 14:13:21,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:13:21,013 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 207 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:13:21,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 610 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:13:21,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-01-09 14:13:21,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 307. [2025-01-09 14:13:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 226 states have (on average 1.323008849557522) internal successors, (299), 226 states have internal predecessors, (299), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 14:13:21,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 451 transitions. [2025-01-09 14:13:21,072 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 451 transitions. Word has length 239 [2025-01-09 14:13:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:13:21,072 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 451 transitions. [2025-01-09 14:13:21,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:13:21,073 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 451 transitions. [2025-01-09 14:13:21,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-01-09 14:13:21,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:13:21,076 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:21,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:13:21,077 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:13:21,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:13:21,077 INFO L85 PathProgramCache]: Analyzing trace with hash -64535033, now seen corresponding path program 1 times [2025-01-09 14:13:21,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:13:21,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557991487] [2025-01-09 14:13:21,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:13:21,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:13:21,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-01-09 14:13:21,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-01-09 14:13:21,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:13:21,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:13:21,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-01-09 14:13:21,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:13:21,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557991487] [2025-01-09 14:13:21,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557991487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:13:21,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:13:21,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:13:21,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378321395] [2025-01-09 14:13:21,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:13:21,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:13:21,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:13:21,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:13:21,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:13:21,795 INFO L87 Difference]: Start difference. First operand 307 states and 451 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:13:22,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:13:22,311 INFO L93 Difference]: Finished difference Result 833 states and 1209 transitions. [2025-01-09 14:13:22,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:13:22,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 240 [2025-01-09 14:13:22,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:13:22,317 INFO L225 Difference]: With dead ends: 833 [2025-01-09 14:13:22,317 INFO L226 Difference]: Without dead ends: 529 [2025-01-09 14:13:22,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:13:22,321 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 222 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:13:22,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 715 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:13:22,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-01-09 14:13:22,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 292. [2025-01-09 14:13:22,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 211 states have (on average 1.3175355450236967) internal successors, (278), 211 states have internal predecessors, (278), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 14:13:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 430 transitions. [2025-01-09 14:13:22,364 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 430 transitions. Word has length 240 [2025-01-09 14:13:22,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:13:22,365 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 430 transitions. [2025-01-09 14:13:22,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:13:22,366 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 430 transitions. [2025-01-09 14:13:22,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-01-09 14:13:22,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:13:22,370 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:22,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:13:22,371 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:13:22,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:13:22,371 INFO L85 PathProgramCache]: Analyzing trace with hash 2028625651, now seen corresponding path program 1 times [2025-01-09 14:13:22,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:13:22,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724387146] [2025-01-09 14:13:22,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:13:22,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:13:22,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-01-09 14:13:22,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-01-09 14:13:22,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:13:22,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:13:23,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-01-09 14:13:23,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:13:23,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724387146] [2025-01-09 14:13:23,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724387146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:13:23,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:13:23,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:13:23,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678256994] [2025-01-09 14:13:23,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:13:23,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:13:23,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:13:23,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:13:23,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:13:23,228 INFO L87 Difference]: Start difference. First operand 292 states and 430 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:13:23,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:13:23,900 INFO L93 Difference]: Finished difference Result 550 states and 810 transitions. [2025-01-09 14:13:23,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:13:23,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 240 [2025-01-09 14:13:23,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:13:23,903 INFO L225 Difference]: With dead ends: 550 [2025-01-09 14:13:23,904 INFO L226 Difference]: Without dead ends: 393 [2025-01-09 14:13:23,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:13:23,907 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 167 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:13:23,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 916 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:13:23,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-01-09 14:13:23,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 273. [2025-01-09 14:13:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 192 states have (on average 1.296875) internal successors, (249), 192 states have internal predecessors, (249), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 14:13:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 401 transitions. [2025-01-09 14:13:23,939 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 401 transitions. Word has length 240 [2025-01-09 14:13:23,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:13:23,940 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 401 transitions. [2025-01-09 14:13:23,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:13:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 401 transitions. [2025-01-09 14:13:23,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-01-09 14:13:23,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:13:23,942 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:23,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:13:23,943 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:13:23,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:13:23,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1843785778, now seen corresponding path program 1 times [2025-01-09 14:13:23,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:13:23,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701051539] [2025-01-09 14:13:23,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:13:23,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:13:23,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-01-09 14:13:24,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-01-09 14:13:24,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:13:24,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:13:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 6 proven. 105 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2025-01-09 14:13:24,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:13:24,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701051539] [2025-01-09 14:13:24,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701051539] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:13:24,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019844183] [2025-01-09 14:13:24,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:13:24,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:13:24,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:13:24,351 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:13:24,369 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:13:24,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-01-09 14:13:24,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-01-09 14:13:24,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:13:24,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:13:24,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 14:13:24,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:13:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 358 proven. 204 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2025-01-09 14:13:25,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:13:25,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 6 proven. 105 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2025-01-09 14:13:25,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019844183] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:13:25,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:13:25,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 14 [2025-01-09 14:13:25,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145192453] [2025-01-09 14:13:25,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:13:25,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 14:13:25,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:13:25,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 14:13:25,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:13:25,863 INFO L87 Difference]: Start difference. First operand 273 states and 401 transitions. Second operand has 14 states, 14 states have (on average 8.285714285714286) internal successors, (116), 14 states have internal predecessors, (116), 4 states have call successors, (108), 3 states have call predecessors, (108), 5 states have return successors, (109), 4 states have call predecessors, (109), 4 states have call successors, (109) [2025-01-09 14:13:26,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:13:26,477 INFO L93 Difference]: Finished difference Result 567 states and 819 transitions. [2025-01-09 14:13:26,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:13:26,478 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.285714285714286) internal successors, (116), 14 states have internal predecessors, (116), 4 states have call successors, (108), 3 states have call predecessors, (108), 5 states have return successors, (109), 4 states have call predecessors, (109), 4 states have call successors, (109) Word has length 241 [2025-01-09 14:13:26,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:13:26,480 INFO L225 Difference]: With dead ends: 567 [2025-01-09 14:13:26,480 INFO L226 Difference]: Without dead ends: 297 [2025-01-09 14:13:26,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:13:26,481 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 276 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:13:26,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 691 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:13:26,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-01-09 14:13:26,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 289. [2025-01-09 14:13:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 204 states have (on average 1.2598039215686274) internal successors, (257), 204 states have internal predecessors, (257), 76 states have call successors, (76), 8 states have call predecessors, (76), 8 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 14:13:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 409 transitions. [2025-01-09 14:13:26,506 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 409 transitions. Word has length 241 [2025-01-09 14:13:26,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:13:26,506 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 409 transitions. [2025-01-09 14:13:26,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.285714285714286) internal successors, (116), 14 states have internal predecessors, (116), 4 states have call successors, (108), 3 states have call predecessors, (108), 5 states have return successors, (109), 4 states have call predecessors, (109), 4 states have call successors, (109) [2025-01-09 14:13:26,507 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 409 transitions. [2025-01-09 14:13:26,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-01-09 14:13:26,508 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:13:26,508 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:26,516 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:13:26,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:13:26,710 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:13:26,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:13:26,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1642323316, now seen corresponding path program 1 times [2025-01-09 14:13:26,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:13:26,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719328347] [2025-01-09 14:13:26,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:13:26,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:13:26,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-01-09 14:13:26,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-01-09 14:13:26,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:13:26,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:13:26,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [572357956] [2025-01-09 14:13:26,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:13:26,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:13:26,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:13:26,881 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:13:26,883 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:13:26,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes.