./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-11.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-11.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 938d0421a545f95d5fd4476ad4101c37e59d7c0d9287a6793e2d4f45bec79d41 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:19:46,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:19:46,907 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:19:46,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:19:46,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:19:46,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:19:46,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:19:46,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:19:46,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:19:46,932 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:19:46,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:19:46,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:19:46,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:19:46,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:19:46,932 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:19:46,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:19:46,932 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:19:46,932 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:19:46,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:19:46,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:19:46,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:19:46,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:19:46,933 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:19:46,933 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:19:46,933 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:19:46,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:19:46,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:19:46,934 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 -> 938d0421a545f95d5fd4476ad4101c37e59d7c0d9287a6793e2d4f45bec79d41 [2025-01-09 14:19:47,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:19:47,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:19:47,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:19:47,147 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:19:47,147 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:19:47,147 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-11.i [2025-01-09 14:19:48,302 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5aa523e9/5e1eabcd11304d46b47db0ed275582e3/FLAG0c20e2ec6 [2025-01-09 14:19:48,539 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:19:48,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-11.i [2025-01-09 14:19:48,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5aa523e9/5e1eabcd11304d46b47db0ed275582e3/FLAG0c20e2ec6 [2025-01-09 14:19:48,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5aa523e9/5e1eabcd11304d46b47db0ed275582e3 [2025-01-09 14:19:48,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:19:48,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:19:48,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:19:48,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:19:48,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:19:48,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:19:48" (1/1) ... [2025-01-09 14:19:48,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d57fddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:48, skipping insertion in model container [2025-01-09 14:19:48,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:19:48" (1/1) ... [2025-01-09 14:19:48,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:19:48,949 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-11.i[916,929] [2025-01-09 14:19:49,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:19:49,092 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:19:49,101 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-11.i[916,929] [2025-01-09 14:19:49,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:19:49,181 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:19:49,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:49 WrapperNode [2025-01-09 14:19:49,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:19:49,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:19:49,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:19:49,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:19:49,188 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:19:49" (1/1) ... [2025-01-09 14:19:49,199 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:19:49" (1/1) ... [2025-01-09 14:19:49,238 INFO L138 Inliner]: procedures = 26, calls = 58, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 431 [2025-01-09 14:19:49,239 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:19:49,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:19:49,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:19:49,239 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:19:49,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:49" (1/1) ... [2025-01-09 14:19:49,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:49" (1/1) ... [2025-01-09 14:19:49,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:49" (1/1) ... [2025-01-09 14:19:49,283 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:19:49,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:49" (1/1) ... [2025-01-09 14:19:49,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:49" (1/1) ... [2025-01-09 14:19:49,301 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:49" (1/1) ... [2025-01-09 14:19:49,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:49" (1/1) ... [2025-01-09 14:19:49,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:49" (1/1) ... [2025-01-09 14:19:49,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:49" (1/1) ... [2025-01-09 14:19:49,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:49" (1/1) ... [2025-01-09 14:19:49,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:19:49,334 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:19:49,334 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:19:49,334 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:19:49,335 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:49" (1/1) ... [2025-01-09 14:19:49,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:19:49,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:19:49,366 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:19:49,373 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:19:49,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:19:49,386 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:19:49,386 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:19:49,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:19:49,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:19:49,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:19:49,463 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:19:49,464 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:19:50,034 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-01-09 14:19:50,034 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:19:50,046 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:19:50,048 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:19:50,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:19:50 BoogieIcfgContainer [2025-01-09 14:19:50,048 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:19:50,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:19:50,050 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:19:50,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:19:50,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:19:48" (1/3) ... [2025-01-09 14:19:50,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd015c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:19:50, skipping insertion in model container [2025-01-09 14:19:50,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:49" (2/3) ... [2025-01-09 14:19:50,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd015c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:19:50, skipping insertion in model container [2025-01-09 14:19:50,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:19:50" (3/3) ... [2025-01-09 14:19:50,055 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-11.i [2025-01-09 14:19:50,066 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:19:50,069 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-11.i that has 2 procedures, 174 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:19:50,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:19:50,128 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;@1d79790a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:19:50,128 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:19:50,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 126 states have (on average 1.4761904761904763) internal successors, (186), 127 states have internal predecessors, (186), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 14:19:50,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-01-09 14:19:50,186 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:50,187 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:50,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:50,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:50,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1634279056, now seen corresponding path program 1 times [2025-01-09 14:19:50,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:50,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221386928] [2025-01-09 14:19:50,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:50,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:50,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-01-09 14:19:50,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-01-09 14:19:50,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:50,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2025-01-09 14:19:50,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:50,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221386928] [2025-01-09 14:19:50,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221386928] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:19:50,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166633029] [2025-01-09 14:19:50,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:50,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:19:50,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:19:50,561 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:19:50,569 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:19:50,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-01-09 14:19:50,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-01-09 14:19:50,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:50,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:50,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:19:50,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:19:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2025-01-09 14:19:50,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:19:50,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166633029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:50,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:19:50,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:19:50,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506882828] [2025-01-09 14:19:50,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:50,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:19:50,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:50,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:19:50,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:19:50,861 INFO L87 Difference]: Start difference. First operand has 174 states, 126 states have (on average 1.4761904761904763) internal successors, (186), 127 states have internal predecessors, (186), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 2 states, 2 states have (on average 46.5) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) [2025-01-09 14:19:50,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:50,893 INFO L93 Difference]: Finished difference Result 340 states and 590 transitions. [2025-01-09 14:19:50,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:19:50,895 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 46.5) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) Word has length 313 [2025-01-09 14:19:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:50,900 INFO L225 Difference]: With dead ends: 340 [2025-01-09 14:19:50,902 INFO L226 Difference]: Without dead ends: 169 [2025-01-09 14:19:50,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 314 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:19:50,908 INFO L435 NwaCegarLoop]: 265 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, 265 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:19:50,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:19:50,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-09 14:19:50,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-01-09 14:19:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 122 states have internal predecessors, (175), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 14:19:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 265 transitions. [2025-01-09 14:19:50,961 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 265 transitions. Word has length 313 [2025-01-09 14:19:50,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:50,963 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 265 transitions. [2025-01-09 14:19:50,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 46.5) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) [2025-01-09 14:19:50,964 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 265 transitions. [2025-01-09 14:19:50,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-01-09 14:19:50,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:50,970 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:50,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:19:51,171 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:19:51,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:51,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:51,173 INFO L85 PathProgramCache]: Analyzing trace with hash -470935344, now seen corresponding path program 1 times [2025-01-09 14:19:51,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:51,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062129910] [2025-01-09 14:19:51,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:51,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:51,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-01-09 14:19:51,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-01-09 14:19:51,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:51,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:51,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:19:51,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:51,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062129910] [2025-01-09 14:19:51,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062129910] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:51,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:51,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:19:51,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680614597] [2025-01-09 14:19:51,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:51,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:19:51,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:51,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:19:51,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:19:51,601 INFO L87 Difference]: Start difference. First operand 169 states and 265 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:19:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:51,819 INFO L93 Difference]: Finished difference Result 502 states and 790 transitions. [2025-01-09 14:19:51,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:19:51,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 313 [2025-01-09 14:19:51,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:51,823 INFO L225 Difference]: With dead ends: 502 [2025-01-09 14:19:51,823 INFO L226 Difference]: Without dead ends: 336 [2025-01-09 14:19:51,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:19:51,828 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 207 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:51,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 777 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:19:51,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-01-09 14:19:51,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 327. [2025-01-09 14:19:51,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 234 states have (on average 1.4401709401709402) internal successors, (337), 234 states have internal predecessors, (337), 90 states have call successors, (90), 2 states have call predecessors, (90), 2 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 14:19:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 517 transitions. [2025-01-09 14:19:51,872 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 517 transitions. Word has length 313 [2025-01-09 14:19:51,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:51,873 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 517 transitions. [2025-01-09 14:19:51,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:19:51,873 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 517 transitions. [2025-01-09 14:19:51,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-01-09 14:19:51,876 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:51,876 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:51,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:19:51,877 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:51,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:51,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1385190341, now seen corresponding path program 1 times [2025-01-09 14:19:51,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:51,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210936651] [2025-01-09 14:19:51,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:51,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:51,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-01-09 14:19:51,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-01-09 14:19:51,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:51,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:19:52,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:52,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210936651] [2025-01-09 14:19:52,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210936651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:52,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:52,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:19:52,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530863638] [2025-01-09 14:19:52,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:52,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:19:52,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:52,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:19:52,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:19:52,074 INFO L87 Difference]: Start difference. First operand 327 states and 517 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:19:52,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:52,155 INFO L93 Difference]: Finished difference Result 754 states and 1192 transitions. [2025-01-09 14:19:52,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:19:52,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 314 [2025-01-09 14:19:52,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:52,160 INFO L225 Difference]: With dead ends: 754 [2025-01-09 14:19:52,160 INFO L226 Difference]: Without dead ends: 540 [2025-01-09 14:19:52,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:19:52,161 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 220 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:52,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 627 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:19:52,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-01-09 14:19:52,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 389. [2025-01-09 14:19:52,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 296 states have (on average 1.4493243243243243) internal successors, (429), 296 states have internal predecessors, (429), 90 states have call successors, (90), 2 states have call predecessors, (90), 2 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 14:19:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 609 transitions. [2025-01-09 14:19:52,200 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 609 transitions. Word has length 314 [2025-01-09 14:19:52,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:52,200 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 609 transitions. [2025-01-09 14:19:52,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:19:52,201 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 609 transitions. [2025-01-09 14:19:52,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-01-09 14:19:52,204 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:52,204 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:52,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:19:52,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:52,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:52,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2012224146, now seen corresponding path program 1 times [2025-01-09 14:19:52,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:52,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264492849] [2025-01-09 14:19:52,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:52,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:52,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-01-09 14:19:52,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-01-09 14:19:52,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:52,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:52,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:19:52,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:52,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264492849] [2025-01-09 14:19:52,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264492849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:52,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:52,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:19:52,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795427408] [2025-01-09 14:19:52,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:52,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:19:52,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:52,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:19:52,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:19:52,515 INFO L87 Difference]: Start difference. First operand 389 states and 609 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:19:52,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:52,676 INFO L93 Difference]: Finished difference Result 825 states and 1284 transitions. [2025-01-09 14:19:52,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:19:52,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 315 [2025-01-09 14:19:52,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:52,682 INFO L225 Difference]: With dead ends: 825 [2025-01-09 14:19:52,682 INFO L226 Difference]: Without dead ends: 608 [2025-01-09 14:19:52,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:19:52,684 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 250 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:52,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 469 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:19:52,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-01-09 14:19:52,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2025-01-09 14:19:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 465 states have (on average 1.4387096774193548) internal successors, (669), 465 states have internal predecessors, (669), 135 states have call successors, (135), 3 states have call predecessors, (135), 3 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 14:19:52,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 939 transitions. [2025-01-09 14:19:52,729 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 939 transitions. Word has length 315 [2025-01-09 14:19:52,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:52,731 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 939 transitions. [2025-01-09 14:19:52,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:19:52,731 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 939 transitions. [2025-01-09 14:19:52,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-01-09 14:19:52,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:52,734 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:52,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:19:52,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:52,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:52,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1344618428, now seen corresponding path program 1 times [2025-01-09 14:19:52,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:52,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167894491] [2025-01-09 14:19:52,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:52,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:52,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-01-09 14:19:53,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-01-09 14:19:53,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:53,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:19:53,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:53,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167894491] [2025-01-09 14:19:53,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167894491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:53,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:53,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:19:53,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113648017] [2025-01-09 14:19:53,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:53,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:19:53,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:53,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:19:53,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:19:53,915 INFO L87 Difference]: Start difference. First operand 604 states and 939 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:19:54,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:54,753 INFO L93 Difference]: Finished difference Result 1471 states and 2260 transitions. [2025-01-09 14:19:54,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:19:54,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 315 [2025-01-09 14:19:54,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:54,759 INFO L225 Difference]: With dead ends: 1471 [2025-01-09 14:19:54,759 INFO L226 Difference]: Without dead ends: 1013 [2025-01-09 14:19:54,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:19:54,760 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 822 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:54,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1463 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:19:54,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-01-09 14:19:54,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 662. [2025-01-09 14:19:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 522 states have (on average 1.4406130268199233) internal successors, (752), 522 states have internal predecessors, (752), 135 states have call successors, (135), 4 states have call predecessors, (135), 4 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 14:19:54,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1022 transitions. [2025-01-09 14:19:54,808 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1022 transitions. Word has length 315 [2025-01-09 14:19:54,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:54,809 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1022 transitions. [2025-01-09 14:19:54,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:19:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1022 transitions. [2025-01-09 14:19:54,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-01-09 14:19:54,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:54,812 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:54,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:19:54,813 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:54,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:54,813 INFO L85 PathProgramCache]: Analyzing trace with hash -683967682, now seen corresponding path program 1 times [2025-01-09 14:19:54,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:54,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547901165] [2025-01-09 14:19:54,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:54,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:54,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-01-09 14:19:54,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-01-09 14:19:54,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:54,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:19:55,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:55,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547901165] [2025-01-09 14:19:55,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547901165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:55,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:55,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:19:55,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440432344] [2025-01-09 14:19:55,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:55,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:19:55,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:55,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:19:55,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:19:55,182 INFO L87 Difference]: Start difference. First operand 662 states and 1022 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:19:55,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:55,210 INFO L93 Difference]: Finished difference Result 1165 states and 1803 transitions. [2025-01-09 14:19:55,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:19:55,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 315 [2025-01-09 14:19:55,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:55,214 INFO L225 Difference]: With dead ends: 1165 [2025-01-09 14:19:55,214 INFO L226 Difference]: Without dead ends: 670 [2025-01-09 14:19:55,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:19:55,215 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:55,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 522 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:19:55,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2025-01-09 14:19:55,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2025-01-09 14:19:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 530 states have (on average 1.4339622641509433) internal successors, (760), 530 states have internal predecessors, (760), 135 states have call successors, (135), 4 states have call predecessors, (135), 4 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 14:19:55,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1030 transitions. [2025-01-09 14:19:55,247 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1030 transitions. Word has length 315 [2025-01-09 14:19:55,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:55,247 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 1030 transitions. [2025-01-09 14:19:55,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:19:55,247 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1030 transitions. [2025-01-09 14:19:55,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-01-09 14:19:55,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:55,250 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:55,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:19:55,250 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:55,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:55,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1713326980, now seen corresponding path program 1 times [2025-01-09 14:19:55,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:55,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138885595] [2025-01-09 14:19:55,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:55,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:55,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-01-09 14:19:55,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-01-09 14:19:55,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:55,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:56,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:19:56,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:56,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138885595] [2025-01-09 14:19:56,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138885595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:56,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:56,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:19:56,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318424901] [2025-01-09 14:19:56,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:56,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:19:56,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:56,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:19:56,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:19:56,610 INFO L87 Difference]: Start difference. First operand 670 states and 1030 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:19:57,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:57,541 INFO L93 Difference]: Finished difference Result 2320 states and 3525 transitions. [2025-01-09 14:19:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:19:57,541 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 315 [2025-01-09 14:19:57,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:57,549 INFO L225 Difference]: With dead ends: 2320 [2025-01-09 14:19:57,549 INFO L226 Difference]: Without dead ends: 1918 [2025-01-09 14:19:57,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:19:57,550 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 1005 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:57,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 1039 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:19:57,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2025-01-09 14:19:57,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 934. [2025-01-09 14:19:57,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 791 states have (on average 1.461441213653603) internal successors, (1156), 791 states have internal predecessors, (1156), 135 states have call successors, (135), 7 states have call predecessors, (135), 7 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 14:19:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1426 transitions. [2025-01-09 14:19:57,612 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1426 transitions. Word has length 315 [2025-01-09 14:19:57,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:57,613 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1426 transitions. [2025-01-09 14:19:57,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:19:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1426 transitions. [2025-01-09 14:19:57,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-01-09 14:19:57,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:57,618 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:57,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:19:57,618 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:57,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:57,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1560571962, now seen corresponding path program 1 times [2025-01-09 14:19:57,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:57,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422333454] [2025-01-09 14:19:57,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:57,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:57,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-01-09 14:19:57,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-01-09 14:19:57,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:57,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:57,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:19:57,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:57,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422333454] [2025-01-09 14:19:57,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422333454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:57,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:57,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:19:57,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007444646] [2025-01-09 14:19:57,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:57,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:19:57,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:57,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:19:57,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:19:57,863 INFO L87 Difference]: Start difference. First operand 934 states and 1426 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:19:57,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:57,902 INFO L93 Difference]: Finished difference Result 1497 states and 2287 transitions. [2025-01-09 14:19:57,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:19:57,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 315 [2025-01-09 14:19:57,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:57,909 INFO L225 Difference]: With dead ends: 1497 [2025-01-09 14:19:57,909 INFO L226 Difference]: Without dead ends: 934 [2025-01-09 14:19:57,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:19:57,912 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:57,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 522 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:19:57,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-01-09 14:19:57,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2025-01-09 14:19:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 791 states have (on average 1.4513274336283186) internal successors, (1148), 791 states have internal predecessors, (1148), 135 states have call successors, (135), 7 states have call predecessors, (135), 7 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 14:19:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1418 transitions. [2025-01-09 14:19:57,949 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1418 transitions. Word has length 315 [2025-01-09 14:19:57,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:57,950 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1418 transitions. [2025-01-09 14:19:57,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:19:57,950 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1418 transitions. [2025-01-09 14:19:57,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-01-09 14:19:57,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:57,954 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:57,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:19:57,954 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:57,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:57,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1690694726, now seen corresponding path program 1 times [2025-01-09 14:19:57,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:57,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218534189] [2025-01-09 14:19:57,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:57,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:57,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-01-09 14:19:58,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-01-09 14:19:58,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:58,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 6 proven. 126 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:19:58,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:58,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218534189] [2025-01-09 14:19:58,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218534189] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:19:58,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344600634] [2025-01-09 14:19:58,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:58,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:19:58,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:19:58,472 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:19:58,476 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:19:58,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-01-09 14:19:58,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-01-09 14:19:58,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:58,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:58,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:19:58,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:19:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 384 proven. 126 refuted. 0 times theorem prover too weak. 3450 trivial. 0 not checked. [2025-01-09 14:19:59,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:19:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 6 proven. 126 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:19:59,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344600634] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:19:59,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:19:59,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 14:19:59,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087166006] [2025-01-09 14:19:59,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:19:59,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:19:59,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:59,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:19:59,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:19:59,349 INFO L87 Difference]: Start difference. First operand 934 states and 1418 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) [2025-01-09 14:19:59,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:59,634 INFO L93 Difference]: Finished difference Result 1693 states and 2557 transitions. [2025-01-09 14:19:59,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:19:59,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) Word has length 315 [2025-01-09 14:19:59,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:59,640 INFO L225 Difference]: With dead ends: 1693 [2025-01-09 14:19:59,640 INFO L226 Difference]: Without dead ends: 952 [2025-01-09 14:19:59,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 628 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:19:59,643 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 123 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:59,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 517 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:19:59,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2025-01-09 14:19:59,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 932. [2025-01-09 14:19:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 786 states have (on average 1.4312977099236641) internal successors, (1125), 786 states have internal predecessors, (1125), 135 states have call successors, (135), 10 states have call predecessors, (135), 10 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 14:19:59,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1395 transitions. [2025-01-09 14:19:59,684 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1395 transitions. Word has length 315 [2025-01-09 14:19:59,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:59,684 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1395 transitions. [2025-01-09 14:19:59,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) [2025-01-09 14:19:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1395 transitions. [2025-01-09 14:19:59,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-01-09 14:19:59,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:59,687 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:59,696 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:19:59,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:19:59,888 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:59,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:59,889 INFO L85 PathProgramCache]: Analyzing trace with hash 253135821, now seen corresponding path program 1 times [2025-01-09 14:19:59,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:59,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613085156] [2025-01-09 14:19:59,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:59,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:59,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-01-09 14:20:00,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-01-09 14:20:00,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:00,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:03,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:20:03,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:03,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613085156] [2025-01-09 14:20:03,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613085156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:03,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:03,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:20:03,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626693535] [2025-01-09 14:20:03,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:03,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:20:03,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:03,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:20:03,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:20:03,159 INFO L87 Difference]: Start difference. First operand 932 states and 1395 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:20:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:03,744 INFO L93 Difference]: Finished difference Result 2011 states and 3000 transitions. [2025-01-09 14:20:03,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:20:03,745 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 317 [2025-01-09 14:20:03,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:03,751 INFO L225 Difference]: With dead ends: 2011 [2025-01-09 14:20:03,751 INFO L226 Difference]: Without dead ends: 1246 [2025-01-09 14:20:03,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:20:03,753 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 439 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:03,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1300 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:20:03,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2025-01-09 14:20:03,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1192. [2025-01-09 14:20:03,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 1046 states have (on average 1.4416826003824093) internal successors, (1508), 1046 states have internal predecessors, (1508), 135 states have call successors, (135), 10 states have call predecessors, (135), 10 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 14:20:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1778 transitions. [2025-01-09 14:20:03,797 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1778 transitions. Word has length 317 [2025-01-09 14:20:03,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:03,798 INFO L471 AbstractCegarLoop]: Abstraction has 1192 states and 1778 transitions. [2025-01-09 14:20:03,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:20:03,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1778 transitions. [2025-01-09 14:20:03,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-01-09 14:20:03,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:03,800 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:03,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:20:03,800 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:03,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:03,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1592231345, now seen corresponding path program 1 times [2025-01-09 14:20:03,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:03,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119579585] [2025-01-09 14:20:03,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:03,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:03,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-01-09 14:20:03,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-01-09 14:20:03,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:03,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 111 proven. 21 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:20:04,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:04,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119579585] [2025-01-09 14:20:04,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119579585] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:20:04,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518995470] [2025-01-09 14:20:04,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:04,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:20:04,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:20:04,229 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:20:04,230 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:20:04,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-01-09 14:20:04,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-01-09 14:20:04,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:04,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:04,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 14:20:04,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:20:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1952 proven. 78 refuted. 0 times theorem prover too weak. 1930 trivial. 0 not checked. [2025-01-09 14:20:04,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:20:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 54 proven. 78 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:20:05,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518995470] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:20:05,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:20:05,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2025-01-09 14:20:05,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989270881] [2025-01-09 14:20:05,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:20:05,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 14:20:05,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:05,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 14:20:05,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:20:05,123 INFO L87 Difference]: Start difference. First operand 1192 states and 1778 transitions. Second operand has 16 states, 16 states have (on average 12.875) internal successors, (206), 16 states have internal predecessors, (206), 4 states have call successors, (97), 2 states have call predecessors, (97), 4 states have return successors, (99), 4 states have call predecessors, (99), 4 states have call successors, (99) [2025-01-09 14:20:06,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:06,815 INFO L93 Difference]: Finished difference Result 4297 states and 6425 transitions. [2025-01-09 14:20:06,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-01-09 14:20:06,816 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.875) internal successors, (206), 16 states have internal predecessors, (206), 4 states have call successors, (97), 2 states have call predecessors, (97), 4 states have return successors, (99), 4 states have call predecessors, (99), 4 states have call successors, (99) Word has length 317 [2025-01-09 14:20:06,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:06,825 INFO L225 Difference]: With dead ends: 4297 [2025-01-09 14:20:06,825 INFO L226 Difference]: Without dead ends: 3234 [2025-01-09 14:20:06,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 631 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=610, Invalid=2146, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 14:20:06,828 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 1106 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 1937 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:06,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 1937 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:20:06,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3234 states. [2025-01-09 14:20:06,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3234 to 2515. [2025-01-09 14:20:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2515 states, 2321 states have (on average 1.4411891426109436) internal successors, (3345), 2322 states have internal predecessors, (3345), 172 states have call successors, (172), 21 states have call predecessors, (172), 21 states have return successors, (172), 171 states have call predecessors, (172), 172 states have call successors, (172) [2025-01-09 14:20:06,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 3689 transitions. [2025-01-09 14:20:06,919 INFO L78 Accepts]: Start accepts. Automaton has 2515 states and 3689 transitions. Word has length 317 [2025-01-09 14:20:06,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:06,919 INFO L471 AbstractCegarLoop]: Abstraction has 2515 states and 3689 transitions. [2025-01-09 14:20:06,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.875) internal successors, (206), 16 states have internal predecessors, (206), 4 states have call successors, (97), 2 states have call predecessors, (97), 4 states have return successors, (99), 4 states have call predecessors, (99), 4 states have call successors, (99) [2025-01-09 14:20:06,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 3689 transitions. [2025-01-09 14:20:06,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-01-09 14:20:06,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:06,922 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:06,929 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:20:07,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:20:07,127 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:07,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:07,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1752691938, now seen corresponding path program 1 times [2025-01-09 14:20:07,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:07,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867587255] [2025-01-09 14:20:07,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:07,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:07,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-01-09 14:20:07,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-01-09 14:20:07,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:07,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 54 proven. 78 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:20:07,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:07,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867587255] [2025-01-09 14:20:07,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867587255] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:20:07,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969929247] [2025-01-09 14:20:07,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:07,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:20:07,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:20:07,714 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:20:07,716 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:20:07,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-01-09 14:20:07,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-01-09 14:20:07,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:07,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:07,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 14:20:07,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:20:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1980 proven. 150 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2025-01-09 14:20:08,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:20:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 54 proven. 78 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:20:09,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969929247] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:20:09,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:20:09,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 10] total 23 [2025-01-09 14:20:09,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904241784] [2025-01-09 14:20:09,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:20:09,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 14:20:09,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:09,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 14:20:09,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2025-01-09 14:20:09,029 INFO L87 Difference]: Start difference. First operand 2515 states and 3689 transitions. Second operand has 23 states, 23 states have (on average 10.347826086956522) internal successors, (238), 23 states have internal predecessors, (238), 4 states have call successors, (97), 3 states have call predecessors, (97), 5 states have return successors, (98), 4 states have call predecessors, (98), 4 states have call successors, (98) [2025-01-09 14:20:11,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:11,263 INFO L93 Difference]: Finished difference Result 6545 states and 9607 transitions. [2025-01-09 14:20:11,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-01-09 14:20:11,264 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 10.347826086956522) internal successors, (238), 23 states have internal predecessors, (238), 4 states have call successors, (97), 3 states have call predecessors, (97), 5 states have return successors, (98), 4 states have call predecessors, (98), 4 states have call successors, (98) Word has length 318 [2025-01-09 14:20:11,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:11,278 INFO L225 Difference]: With dead ends: 6545 [2025-01-09 14:20:11,279 INFO L226 Difference]: Without dead ends: 4945 [2025-01-09 14:20:11,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=907, Invalid=2633, Unknown=0, NotChecked=0, Total=3540 [2025-01-09 14:20:11,282 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 1432 mSDsluCounter, 1990 mSDsCounter, 0 mSdLazyCounter, 2300 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1434 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 2300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:11,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1434 Valid, 2321 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 2300 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 14:20:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4945 states. [2025-01-09 14:20:11,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4945 to 2157. [2025-01-09 14:20:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2157 states, 1959 states have (on average 1.3961204696273608) internal successors, (2735), 1960 states have internal predecessors, (2735), 172 states have call successors, (172), 25 states have call predecessors, (172), 25 states have return successors, (172), 171 states have call predecessors, (172), 172 states have call successors, (172) [2025-01-09 14:20:11,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 3079 transitions. [2025-01-09 14:20:11,373 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 3079 transitions. Word has length 318 [2025-01-09 14:20:11,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:11,374 INFO L471 AbstractCegarLoop]: Abstraction has 2157 states and 3079 transitions. [2025-01-09 14:20:11,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.347826086956522) internal successors, (238), 23 states have internal predecessors, (238), 4 states have call successors, (97), 3 states have call predecessors, (97), 5 states have return successors, (98), 4 states have call predecessors, (98), 4 states have call successors, (98) [2025-01-09 14:20:11,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 3079 transitions. [2025-01-09 14:20:11,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-01-09 14:20:11,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:11,377 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:11,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 14:20:11,581 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,SelfDestructingSolverStorable11 [2025-01-09 14:20:11,581 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:11,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:11,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1803373224, now seen corresponding path program 1 times [2025-01-09 14:20:11,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:11,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655167671] [2025-01-09 14:20:11,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:11,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:11,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-01-09 14:20:11,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-01-09 14:20:11,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:11,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:15,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:20:15,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:15,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655167671] [2025-01-09 14:20:15,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655167671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:15,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:15,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 14:20:15,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447129448] [2025-01-09 14:20:15,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:15,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:20:15,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:15,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:20:15,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:20:15,368 INFO L87 Difference]: Start difference. First operand 2157 states and 3079 transitions. Second operand has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-01-09 14:20:16,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:16,816 INFO L93 Difference]: Finished difference Result 4020 states and 5676 transitions. [2025-01-09 14:20:16,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:20:16,817 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 319 [2025-01-09 14:20:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:16,825 INFO L225 Difference]: With dead ends: 4020 [2025-01-09 14:20:16,826 INFO L226 Difference]: Without dead ends: 2782 [2025-01-09 14:20:16,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:20:16,829 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 804 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:16,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1752 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:20:16,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2782 states. [2025-01-09 14:20:16,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 2319. [2025-01-09 14:20:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2319 states, 2121 states have (on average 1.3988684582743989) internal successors, (2967), 2122 states have internal predecessors, (2967), 172 states have call successors, (172), 25 states have call predecessors, (172), 25 states have return successors, (172), 171 states have call predecessors, (172), 172 states have call successors, (172) [2025-01-09 14:20:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 3311 transitions. [2025-01-09 14:20:16,936 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 3311 transitions. Word has length 319 [2025-01-09 14:20:16,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:16,937 INFO L471 AbstractCegarLoop]: Abstraction has 2319 states and 3311 transitions. [2025-01-09 14:20:16,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-01-09 14:20:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 3311 transitions. [2025-01-09 14:20:16,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-01-09 14:20:16,940 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:16,940 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:16,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:20:16,940 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:16,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:16,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2078132838, now seen corresponding path program 1 times [2025-01-09 14:20:16,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:16,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456927814] [2025-01-09 14:20:16,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:16,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:16,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-01-09 14:20:17,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-01-09 14:20:17,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:17,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:18,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 54 proven. 78 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:20:18,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:18,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456927814] [2025-01-09 14:20:18,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456927814] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:20:18,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746923560] [2025-01-09 14:20:18,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:18,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:20:18,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:20:18,071 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:20:18,073 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:20:18,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-01-09 14:20:18,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-01-09 14:20:18,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:18,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:18,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 14:20:18,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:20:19,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1898 proven. 162 refuted. 0 times theorem prover too weak. 1900 trivial. 0 not checked. [2025-01-09 14:20:19,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:20:20,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 96 proven. 165 refuted. 0 times theorem prover too weak. 3699 trivial. 0 not checked. [2025-01-09 14:20:20,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746923560] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:20:20,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:20:20,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2025-01-09 14:20:20,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632029739] [2025-01-09 14:20:20,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:20:20,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 14:20:20,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:20,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 14:20:20,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 14:20:20,175 INFO L87 Difference]: Start difference. First operand 2319 states and 3311 transitions. Second operand has 34 states, 33 states have (on average 6.848484848484849) internal successors, (226), 32 states have internal predecessors, (226), 7 states have call successors, (135), 4 states have call predecessors, (135), 8 states have return successors, (135), 7 states have call predecessors, (135), 7 states have call successors, (135) [2025-01-09 14:20:34,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:34,853 INFO L93 Difference]: Finished difference Result 17343 states and 24711 transitions. [2025-01-09 14:20:34,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2025-01-09 14:20:34,857 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 6.848484848484849) internal successors, (226), 32 states have internal predecessors, (226), 7 states have call successors, (135), 4 states have call predecessors, (135), 8 states have return successors, (135), 7 states have call predecessors, (135), 7 states have call successors, (135) Word has length 319 [2025-01-09 14:20:34,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:34,904 INFO L225 Difference]: With dead ends: 17343 [2025-01-09 14:20:34,905 INFO L226 Difference]: Without dead ends: 15549 [2025-01-09 14:20:34,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 867 GetRequests, 654 SyntacticMatches, 1 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19241 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=6755, Invalid=38827, Unknown=0, NotChecked=0, Total=45582 [2025-01-09 14:20:34,916 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 6464 mSDsluCounter, 7877 mSDsCounter, 0 mSdLazyCounter, 10100 mSolverCounterSat, 2465 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6512 SdHoareTripleChecker+Valid, 8325 SdHoareTripleChecker+Invalid, 12565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2465 IncrementalHoareTripleChecker+Valid, 10100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:34,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6512 Valid, 8325 Invalid, 12565 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2465 Valid, 10100 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2025-01-09 14:20:34,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15549 states. [2025-01-09 14:20:35,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15549 to 6092. [2025-01-09 14:20:35,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6092 states, 5532 states have (on average 1.4027476500361533) internal successors, (7760), 5546 states have internal predecessors, (7760), 485 states have call successors, (485), 74 states have call predecessors, (485), 74 states have return successors, (485), 471 states have call predecessors, (485), 485 states have call successors, (485) [2025-01-09 14:20:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6092 states to 6092 states and 8730 transitions. [2025-01-09 14:20:35,381 INFO L78 Accepts]: Start accepts. Automaton has 6092 states and 8730 transitions. Word has length 319 [2025-01-09 14:20:35,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:35,382 INFO L471 AbstractCegarLoop]: Abstraction has 6092 states and 8730 transitions. [2025-01-09 14:20:35,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 6.848484848484849) internal successors, (226), 32 states have internal predecessors, (226), 7 states have call successors, (135), 4 states have call predecessors, (135), 8 states have return successors, (135), 7 states have call predecessors, (135), 7 states have call successors, (135) [2025-01-09 14:20:35,383 INFO L276 IsEmpty]: Start isEmpty. Operand 6092 states and 8730 transitions. [2025-01-09 14:20:35,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-01-09 14:20:35,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:35,389 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:35,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 14:20:35,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 14:20:35,590 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:35,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:35,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1655900232, now seen corresponding path program 1 times [2025-01-09 14:20:35,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:35,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518203035] [2025-01-09 14:20:35,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:35,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:35,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-09 14:20:35,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-09 14:20:35,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:35,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:20:35,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:35,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518203035] [2025-01-09 14:20:35,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518203035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:35,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:35,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:20:35,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491723882] [2025-01-09 14:20:35,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:35,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:20:35,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:35,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:20:35,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:20:35,941 INFO L87 Difference]: Start difference. First operand 6092 states and 8730 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:20:36,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:36,733 INFO L93 Difference]: Finished difference Result 10183 states and 14542 transitions. [2025-01-09 14:20:36,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:20:36,733 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 320 [2025-01-09 14:20:36,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:36,746 INFO L225 Difference]: With dead ends: 10183 [2025-01-09 14:20:36,746 INFO L226 Difference]: Without dead ends: 6224 [2025-01-09 14:20:36,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:20:36,752 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 779 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:36,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1345 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:20:36,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6224 states. [2025-01-09 14:20:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6224 to 5668. [2025-01-09 14:20:37,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5668 states, 5108 states have (on average 1.3950665622552858) internal successors, (7126), 5122 states have internal predecessors, (7126), 485 states have call successors, (485), 74 states have call predecessors, (485), 74 states have return successors, (485), 471 states have call predecessors, (485), 485 states have call successors, (485) [2025-01-09 14:20:37,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5668 states to 5668 states and 8096 transitions. [2025-01-09 14:20:37,048 INFO L78 Accepts]: Start accepts. Automaton has 5668 states and 8096 transitions. Word has length 320 [2025-01-09 14:20:37,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:37,048 INFO L471 AbstractCegarLoop]: Abstraction has 5668 states and 8096 transitions. [2025-01-09 14:20:37,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:20:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 5668 states and 8096 transitions. [2025-01-09 14:20:37,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-01-09 14:20:37,052 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:37,052 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:37,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:20:37,053 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:37,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:37,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2052261050, now seen corresponding path program 1 times [2025-01-09 14:20:37,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:37,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587755251] [2025-01-09 14:20:37,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:37,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:37,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-09 14:20:37,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-09 14:20:37,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:37,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:39,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:20:39,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:39,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587755251] [2025-01-09 14:20:39,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587755251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:39,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:39,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:20:39,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928605695] [2025-01-09 14:20:39,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:39,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:20:39,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:39,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:20:39,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:20:39,733 INFO L87 Difference]: Start difference. First operand 5668 states and 8096 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-01-09 14:20:40,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:40,864 INFO L93 Difference]: Finished difference Result 9293 states and 13265 transitions. [2025-01-09 14:20:40,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:20:40,865 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 320 [2025-01-09 14:20:40,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:40,882 INFO L225 Difference]: With dead ends: 9293 [2025-01-09 14:20:40,882 INFO L226 Difference]: Without dead ends: 5688 [2025-01-09 14:20:40,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:20:40,889 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 696 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:40,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1545 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:20:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5688 states. [2025-01-09 14:20:41,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5688 to 5556. [2025-01-09 14:20:41,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5556 states, 4996 states have (on average 1.3935148118494796) internal successors, (6962), 5010 states have internal predecessors, (6962), 485 states have call successors, (485), 74 states have call predecessors, (485), 74 states have return successors, (485), 471 states have call predecessors, (485), 485 states have call successors, (485) [2025-01-09 14:20:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5556 states to 5556 states and 7932 transitions. [2025-01-09 14:20:41,156 INFO L78 Accepts]: Start accepts. Automaton has 5556 states and 7932 transitions. Word has length 320 [2025-01-09 14:20:41,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:41,157 INFO L471 AbstractCegarLoop]: Abstraction has 5556 states and 7932 transitions. [2025-01-09 14:20:41,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-01-09 14:20:41,157 INFO L276 IsEmpty]: Start isEmpty. Operand 5556 states and 7932 transitions. [2025-01-09 14:20:41,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-01-09 14:20:41,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:41,161 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:41,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:20:41,161 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:41,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:41,163 INFO L85 PathProgramCache]: Analyzing trace with hash -855920836, now seen corresponding path program 1 times [2025-01-09 14:20:41,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:41,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934034390] [2025-01-09 14:20:41,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:41,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:41,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-09 14:20:41,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-09 14:20:41,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:41,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:20:46,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:46,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934034390] [2025-01-09 14:20:46,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934034390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:46,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:46,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:20:46,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665219842] [2025-01-09 14:20:46,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:46,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:20:46,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:46,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:20:46,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:20:46,177 INFO L87 Difference]: Start difference. First operand 5556 states and 7932 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-01-09 14:20:49,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:49,162 INFO L93 Difference]: Finished difference Result 10272 states and 14615 transitions. [2025-01-09 14:20:49,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:20:49,163 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 320 [2025-01-09 14:20:49,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:49,174 INFO L225 Difference]: With dead ends: 10272 [2025-01-09 14:20:49,175 INFO L226 Difference]: Without dead ends: 6307 [2025-01-09 14:20:49,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:20:49,181 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 1274 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:49,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 1513 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 14:20:49,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6307 states. [2025-01-09 14:20:49,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6307 to 5542. [2025-01-09 14:20:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5542 states, 4982 states have (on average 1.3877960658370132) internal successors, (6914), 4996 states have internal predecessors, (6914), 485 states have call successors, (485), 74 states have call predecessors, (485), 74 states have return successors, (485), 471 states have call predecessors, (485), 485 states have call successors, (485) [2025-01-09 14:20:49,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5542 states to 5542 states and 7884 transitions. [2025-01-09 14:20:49,477 INFO L78 Accepts]: Start accepts. Automaton has 5542 states and 7884 transitions. Word has length 320 [2025-01-09 14:20:49,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:49,478 INFO L471 AbstractCegarLoop]: Abstraction has 5542 states and 7884 transitions. [2025-01-09 14:20:49,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-01-09 14:20:49,478 INFO L276 IsEmpty]: Start isEmpty. Operand 5542 states and 7884 transitions. [2025-01-09 14:20:49,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-01-09 14:20:49,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:49,482 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:49,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 14:20:49,482 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:49,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:49,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1075885644, now seen corresponding path program 1 times [2025-01-09 14:20:49,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:49,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711769207] [2025-01-09 14:20:49,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:49,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:49,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-09 14:20:49,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-09 14:20:49,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:49,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:20:52,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:52,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711769207] [2025-01-09 14:20:52,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711769207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:52,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:52,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:20:52,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395235859] [2025-01-09 14:20:52,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:52,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:20:52,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:52,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:20:52,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:20:52,386 INFO L87 Difference]: Start difference. First operand 5542 states and 7884 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-01-09 14:20:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:54,358 INFO L93 Difference]: Finished difference Result 8743 states and 12423 transitions. [2025-01-09 14:20:54,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:20:54,359 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 320 [2025-01-09 14:20:54,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:54,373 INFO L225 Difference]: With dead ends: 8743 [2025-01-09 14:20:54,373 INFO L226 Difference]: Without dead ends: 6248 [2025-01-09 14:20:54,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:20:54,379 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 844 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:54,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1538 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 14:20:54,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6248 states. [2025-01-09 14:20:54,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6248 to 5976. [2025-01-09 14:20:54,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5976 states, 5416 states have (on average 1.3914327917282128) internal successors, (7536), 5430 states have internal predecessors, (7536), 485 states have call successors, (485), 74 states have call predecessors, (485), 74 states have return successors, (485), 471 states have call predecessors, (485), 485 states have call successors, (485) [2025-01-09 14:20:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5976 states to 5976 states and 8506 transitions. [2025-01-09 14:20:54,696 INFO L78 Accepts]: Start accepts. Automaton has 5976 states and 8506 transitions. Word has length 320 [2025-01-09 14:20:54,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:54,696 INFO L471 AbstractCegarLoop]: Abstraction has 5976 states and 8506 transitions. [2025-01-09 14:20:54,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-01-09 14:20:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 5976 states and 8506 transitions. [2025-01-09 14:20:54,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-01-09 14:20:54,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:54,700 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:54,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 14:20:54,701 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:54,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:54,701 INFO L85 PathProgramCache]: Analyzing trace with hash -670611326, now seen corresponding path program 1 times [2025-01-09 14:20:54,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:54,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479168302] [2025-01-09 14:20:54,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:54,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:54,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-09 14:20:54,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-09 14:20:54,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:54,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:55,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 105 proven. 27 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:20:55,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:55,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479168302] [2025-01-09 14:20:55,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479168302] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:20:55,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348620163] [2025-01-09 14:20:55,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:55,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:20:55,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:20:55,041 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:20:55,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 14:20:55,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-09 14:20:55,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-09 14:20:55,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:55,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:55,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:20:55,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:20:55,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1374 proven. 27 refuted. 0 times theorem prover too weak. 2559 trivial. 0 not checked. [2025-01-09 14:20:55,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:20:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 105 proven. 27 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:20:55,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348620163] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:20:55,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:20:55,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 14:20:55,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522883765] [2025-01-09 14:20:55,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:20:55,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:20:55,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:55,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:20:55,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:20:55,523 INFO L87 Difference]: Start difference. First operand 5976 states and 8506 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-01-09 14:20:56,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:56,193 INFO L93 Difference]: Finished difference Result 11735 states and 16678 transitions. [2025-01-09 14:20:56,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:20:56,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 320 [2025-01-09 14:20:56,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:56,207 INFO L225 Difference]: With dead ends: 11735 [2025-01-09 14:20:56,207 INFO L226 Difference]: Without dead ends: 6060 [2025-01-09 14:20:56,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 637 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:20:56,214 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 321 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:56,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 633 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:20:56,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6060 states. [2025-01-09 14:20:56,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6060 to 6004. [2025-01-09 14:20:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6004 states, 5437 states have (on average 1.3858745631782232) internal successors, (7535), 5451 states have internal predecessors, (7535), 485 states have call successors, (485), 81 states have call predecessors, (485), 81 states have return successors, (485), 471 states have call predecessors, (485), 485 states have call successors, (485) [2025-01-09 14:20:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6004 states to 6004 states and 8505 transitions. [2025-01-09 14:20:56,517 INFO L78 Accepts]: Start accepts. Automaton has 6004 states and 8505 transitions. Word has length 320 [2025-01-09 14:20:56,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:56,517 INFO L471 AbstractCegarLoop]: Abstraction has 6004 states and 8505 transitions. [2025-01-09 14:20:56,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-01-09 14:20:56,518 INFO L276 IsEmpty]: Start isEmpty. Operand 6004 states and 8505 transitions. [2025-01-09 14:20:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-01-09 14:20:56,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:56,522 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:56,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 14:20:56,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:20:56,723 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:56,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:56,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2006947068, now seen corresponding path program 1 times [2025-01-09 14:20:56,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:56,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107025165] [2025-01-09 14:20:56,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:56,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:56,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-09 14:20:56,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-09 14:20:56,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:56,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:20:57,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:57,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107025165] [2025-01-09 14:20:57,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107025165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:57,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:57,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:20:57,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019188736] [2025-01-09 14:20:57,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:57,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:20:57,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:57,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:20:57,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:20:57,059 INFO L87 Difference]: Start difference. First operand 6004 states and 8505 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:20:58,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:58,096 INFO L93 Difference]: Finished difference Result 16700 states and 23790 transitions. [2025-01-09 14:20:58,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:20:58,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 320 [2025-01-09 14:20:58,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:58,124 INFO L225 Difference]: With dead ends: 16700 [2025-01-09 14:20:58,124 INFO L226 Difference]: Without dead ends: 12539 [2025-01-09 14:20:58,129 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:20:58,130 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 378 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:58,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1180 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:20:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12539 states. [2025-01-09 14:20:58,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12539 to 11316. [2025-01-09 14:20:58,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11316 states, 10353 states have (on average 1.3831739592388679) internal successors, (14320), 10375 states have internal predecessors, (14320), 829 states have call successors, (829), 133 states have call predecessors, (829), 133 states have return successors, (829), 807 states have call predecessors, (829), 829 states have call successors, (829) [2025-01-09 14:20:58,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11316 states to 11316 states and 15978 transitions. [2025-01-09 14:20:58,654 INFO L78 Accepts]: Start accepts. Automaton has 11316 states and 15978 transitions. Word has length 320 [2025-01-09 14:20:58,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:58,655 INFO L471 AbstractCegarLoop]: Abstraction has 11316 states and 15978 transitions. [2025-01-09 14:20:58,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:20:58,655 INFO L276 IsEmpty]: Start isEmpty. Operand 11316 states and 15978 transitions. [2025-01-09 14:20:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-01-09 14:20:58,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:58,660 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:58,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 14:20:58,660 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:58,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:58,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2013260614, now seen corresponding path program 1 times [2025-01-09 14:20:58,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:58,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174497404] [2025-01-09 14:20:58,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:58,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:58,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-09 14:20:58,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-09 14:20:58,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:58,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 54 proven. 78 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:20:59,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:59,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174497404] [2025-01-09 14:20:59,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174497404] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:20:59,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893109355] [2025-01-09 14:20:59,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:59,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:20:59,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:20:59,280 INFO L229 MonitoredProcess]: Starting monitored process 8 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:20:59,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 14:20:59,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-09 14:20:59,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-09 14:20:59,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:59,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:59,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-09 14:20:59,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:21:01,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1964 proven. 300 refuted. 0 times theorem prover too weak. 1696 trivial. 0 not checked. [2025-01-09 14:21:01,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:21:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 153 proven. 234 refuted. 0 times theorem prover too weak. 3573 trivial. 0 not checked. [2025-01-09 14:21:02,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893109355] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:21:02,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:21:02,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17, 16] total 36 [2025-01-09 14:21:02,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981415925] [2025-01-09 14:21:02,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:21:02,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-09 14:21:02,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:02,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-09 14:21:02,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=963, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 14:21:02,608 INFO L87 Difference]: Start difference. First operand 11316 states and 15978 transitions. Second operand has 36 states, 34 states have (on average 6.794117647058823) internal successors, (231), 32 states have internal predecessors, (231), 10 states have call successors, (135), 6 states have call predecessors, (135), 11 states have return successors, (135), 10 states have call predecessors, (135), 10 states have call successors, (135) [2025-01-09 14:21:06,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []