./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-73.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_fillercode_fillercodesize_ps-cn-250_file-73.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 076046e86d20a5ef1734fc8e29c600eeeaad5a6d7202972e85f4fad8625f4845 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:46:29,336 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:46:29,402 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:46:29,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:46:29,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:46:29,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:46:29,431 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:46:29,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:46:29,431 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:46:29,431 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:46:29,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:46:29,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:46:29,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:46:29,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:46:29,432 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:46:29,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:46:29,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:46:29,432 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:46:29,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:46:29,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:46:29,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:46:29,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:46:29,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:46:29,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:46:29,432 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:46:29,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:46:29,433 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:46:29,433 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:46:29,433 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:46:29,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:46:29,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:46:29,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:46:29,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:46:29,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:46:29,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:46:29,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:46:29,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:46:29,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:46:29,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:46:29,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:46:29,433 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:46:29,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:46:29,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:46:29,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:46:29,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:46:29,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:46:29,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:46:29,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:46:29,434 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 -> 076046e86d20a5ef1734fc8e29c600eeeaad5a6d7202972e85f4fad8625f4845 [2025-01-09 09:46:29,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:46:29,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:46:29,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:46:29,675 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:46:29,675 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:46:29,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-73.i [2025-01-09 09:46:30,904 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0e57f35a/cc16bd99fb5646a295370bf7050a4380/FLAG3c0dc5c51 [2025-01-09 09:46:31,183 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:46:31,187 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-73.i [2025-01-09 09:46:31,200 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0e57f35a/cc16bd99fb5646a295370bf7050a4380/FLAG3c0dc5c51 [2025-01-09 09:46:31,217 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0e57f35a/cc16bd99fb5646a295370bf7050a4380 [2025-01-09 09:46:31,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:46:31,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:46:31,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:46:31,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:46:31,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:46:31,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:46:31" (1/1) ... [2025-01-09 09:46:31,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b794ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:31, skipping insertion in model container [2025-01-09 09:46:31,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:46:31" (1/1) ... [2025-01-09 09:46:31,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:46:31,371 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_fillercode_fillercodesize_ps-cn-250_file-73.i[916,929] [2025-01-09 09:46:31,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:46:31,489 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:46:31,499 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_fillercode_fillercodesize_ps-cn-250_file-73.i[916,929] [2025-01-09 09:46:31,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:46:31,556 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:46:31,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:31 WrapperNode [2025-01-09 09:46:31,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:46:31,560 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:46:31,560 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:46:31,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:46:31,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:31" (1/1) ... [2025-01-09 09:46:31,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:31" (1/1) ... [2025-01-09 09:46:31,625 INFO L138 Inliner]: procedures = 26, calls = 82, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 542 [2025-01-09 09:46:31,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:46:31,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:46:31,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:46:31,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:46:31,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:31" (1/1) ... [2025-01-09 09:46:31,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:31" (1/1) ... [2025-01-09 09:46:31,638 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:31" (1/1) ... [2025-01-09 09:46:31,651 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 09:46:31,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:31" (1/1) ... [2025-01-09 09:46:31,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:31" (1/1) ... [2025-01-09 09:46:31,665 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:31" (1/1) ... [2025-01-09 09:46:31,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:31" (1/1) ... [2025-01-09 09:46:31,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:31" (1/1) ... [2025-01-09 09:46:31,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:31" (1/1) ... [2025-01-09 09:46:31,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:31" (1/1) ... [2025-01-09 09:46:31,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:46:31,678 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:46:31,678 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:46:31,678 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:46:31,679 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:31" (1/1) ... [2025-01-09 09:46:31,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:46:31,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:46:31,707 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 09:46:31,711 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 09:46:31,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:46:31,731 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:46:31,731 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:46:31,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:46:31,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:46:31,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:46:31,827 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:46:31,829 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:46:32,770 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 09:46:32,770 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:46:32,792 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:46:32,792 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:46:32,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:46:32 BoogieIcfgContainer [2025-01-09 09:46:32,793 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:46:32,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:46:32,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:46:32,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:46:32,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:46:31" (1/3) ... [2025-01-09 09:46:32,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a328021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:46:32, skipping insertion in model container [2025-01-09 09:46:32,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:46:31" (2/3) ... [2025-01-09 09:46:32,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a328021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:46:32, skipping insertion in model container [2025-01-09 09:46:32,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:46:32" (3/3) ... [2025-01-09 09:46:32,802 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-73.i [2025-01-09 09:46:32,812 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:46:32,814 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-73.i that has 2 procedures, 225 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:46:32,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:46:32,860 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;@651c7aef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:46:32,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:46:32,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 225 states, 153 states have (on average 1.5294117647058822) internal successors, (234), 154 states have internal predecessors, (234), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 09:46:32,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-01-09 09:46:32,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:46:32,880 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:46:32,880 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:46:32,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:46:32,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1369139458, now seen corresponding path program 1 times [2025-01-09 09:46:32,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:46:32,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565582104] [2025-01-09 09:46:32,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:32,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:46:32,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-01-09 09:46:33,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-01-09 09:46:33,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:33,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:33,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2025-01-09 09:46:33,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:46:33,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565582104] [2025-01-09 09:46:33,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565582104] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:46:33,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540927890] [2025-01-09 09:46:33,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:33,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:46:33,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:46:33,320 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 09:46:33,321 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 09:46:33,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-01-09 09:46:33,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-01-09 09:46:33,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:33,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:33,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 1034 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:46:33,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:46:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2025-01-09 09:46:33,708 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:46:33,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540927890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:46:33,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:46:33,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:46:33,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686420695] [2025-01-09 09:46:33,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:46:33,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:46:33,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:46:33,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:46:33,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:46:33,741 INFO L87 Difference]: Start difference. First operand has 225 states, 153 states have (on average 1.5294117647058822) internal successors, (234), 154 states have internal predecessors, (234), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) [2025-01-09 09:46:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:46:33,786 INFO L93 Difference]: Finished difference Result 444 states and 808 transitions. [2025-01-09 09:46:33,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:46:33,788 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) Word has length 446 [2025-01-09 09:46:33,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:46:33,794 INFO L225 Difference]: With dead ends: 444 [2025-01-09 09:46:33,794 INFO L226 Difference]: Without dead ends: 222 [2025-01-09 09:46:33,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 447 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 09:46:33,800 INFO L435 NwaCegarLoop]: 367 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, 367 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 09:46:33,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:46:33,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-01-09 09:46:33,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2025-01-09 09:46:33,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 151 states have (on average 1.5165562913907285) internal successors, (229), 151 states have internal predecessors, (229), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 09:46:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 367 transitions. [2025-01-09 09:46:33,858 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 367 transitions. Word has length 446 [2025-01-09 09:46:33,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:46:33,860 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 367 transitions. [2025-01-09 09:46:33,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) [2025-01-09 09:46:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 367 transitions. [2025-01-09 09:46:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-01-09 09:46:33,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:46:33,869 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:46:33,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 09:46:34,071 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 09:46:34,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:46:34,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:46:34,073 INFO L85 PathProgramCache]: Analyzing trace with hash -491150644, now seen corresponding path program 1 times [2025-01-09 09:46:34,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:46:34,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903224957] [2025-01-09 09:46:34,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:34,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:46:34,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-01-09 09:46:34,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-01-09 09:46:34,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:34,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:46:34,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:46:34,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903224957] [2025-01-09 09:46:34,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903224957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:46:34,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:46:34,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:46:34,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814561081] [2025-01-09 09:46:34,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:46:34,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:46:34,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:46:34,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:46:34,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:46:34,476 INFO L87 Difference]: Start difference. First operand 222 states and 367 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:46:34,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:46:34,559 INFO L93 Difference]: Finished difference Result 582 states and 962 transitions. [2025-01-09 09:46:34,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:46:34,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 446 [2025-01-09 09:46:34,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:46:34,566 INFO L225 Difference]: With dead ends: 582 [2025-01-09 09:46:34,566 INFO L226 Difference]: Without dead ends: 363 [2025-01-09 09:46:34,568 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 09:46:34,570 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 242 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:46:34,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 793 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:46:34,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-01-09 09:46:34,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 360. [2025-01-09 09:46:34,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 248 states have (on average 1.4959677419354838) internal successors, (371), 249 states have internal predecessors, (371), 109 states have call successors, (109), 2 states have call predecessors, (109), 2 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-01-09 09:46:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 589 transitions. [2025-01-09 09:46:34,615 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 589 transitions. Word has length 446 [2025-01-09 09:46:34,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:46:34,616 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 589 transitions. [2025-01-09 09:46:34,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:46:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 589 transitions. [2025-01-09 09:46:34,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-01-09 09:46:34,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:46:34,621 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:46:34,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:46:34,622 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:46:34,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:46:34,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1655976776, now seen corresponding path program 1 times [2025-01-09 09:46:34,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:46:34,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402127739] [2025-01-09 09:46:34,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:34,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:46:34,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-01-09 09:46:34,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-01-09 09:46:34,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:34,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 18 proven. 186 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-01-09 09:46:35,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:46:35,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402127739] [2025-01-09 09:46:35,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402127739] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:46:35,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131083101] [2025-01-09 09:46:35,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:35,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:46:35,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:46:35,341 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 09:46:35,346 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 09:46:35,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-01-09 09:46:35,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-01-09 09:46:35,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:35,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:35,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 1034 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 09:46:35,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:46:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:46:36,696 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:46:36,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131083101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:46:36,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:46:36,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-01-09 09:46:36,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520140231] [2025-01-09 09:46:36,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:46:36,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:46:36,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:46:36,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:46:36,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:46:36,698 INFO L87 Difference]: Start difference. First operand 360 states and 589 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:46:36,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:46:36,763 INFO L93 Difference]: Finished difference Result 1074 states and 1761 transitions. [2025-01-09 09:46:36,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:46:36,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 446 [2025-01-09 09:46:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:46:36,769 INFO L225 Difference]: With dead ends: 1074 [2025-01-09 09:46:36,769 INFO L226 Difference]: Without dead ends: 717 [2025-01-09 09:46:36,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:46:36,771 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 157 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:46:36,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 794 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:46:36,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-01-09 09:46:36,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2025-01-09 09:46:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 492 states have (on average 1.4898373983739837) internal successors, (733), 494 states have internal predecessors, (733), 218 states have call successors, (218), 4 states have call predecessors, (218), 4 states have return successors, (218), 216 states have call predecessors, (218), 218 states have call successors, (218) [2025-01-09 09:46:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1169 transitions. [2025-01-09 09:46:36,840 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1169 transitions. Word has length 446 [2025-01-09 09:46:36,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:46:36,841 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1169 transitions. [2025-01-09 09:46:36,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:46:36,841 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1169 transitions. [2025-01-09 09:46:36,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-01-09 09:46:36,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:46:36,846 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:46:36,853 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 09:46:37,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:46:37,047 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:46:37,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:46:37,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2065307357, now seen corresponding path program 1 times [2025-01-09 09:46:37,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:46:37,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165774079] [2025-01-09 09:46:37,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:37,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:46:37,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-01-09 09:46:37,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-01-09 09:46:37,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:37,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:46:37,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:46:37,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165774079] [2025-01-09 09:46:37,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165774079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:46:37,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:46:37,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:46:37,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695654226] [2025-01-09 09:46:37,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:46:37,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:46:37,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:46:37,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:46:37,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:46:37,245 INFO L87 Difference]: Start difference. First operand 715 states and 1169 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:46:37,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:46:37,301 INFO L93 Difference]: Finished difference Result 1425 states and 2331 transitions. [2025-01-09 09:46:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:46:37,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 447 [2025-01-09 09:46:37,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:46:37,309 INFO L225 Difference]: With dead ends: 1425 [2025-01-09 09:46:37,309 INFO L226 Difference]: Without dead ends: 713 [2025-01-09 09:46:37,311 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 09:46:37,313 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 241 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:46:37,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 352 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:46:37,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-01-09 09:46:37,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2025-01-09 09:46:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 490 states have (on average 1.4836734693877551) internal successors, (727), 492 states have internal predecessors, (727), 218 states have call successors, (218), 4 states have call predecessors, (218), 4 states have return successors, (218), 216 states have call predecessors, (218), 218 states have call successors, (218) [2025-01-09 09:46:37,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1163 transitions. [2025-01-09 09:46:37,369 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1163 transitions. Word has length 447 [2025-01-09 09:46:37,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:46:37,370 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 1163 transitions. [2025-01-09 09:46:37,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:46:37,370 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1163 transitions. [2025-01-09 09:46:37,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-01-09 09:46:37,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:46:37,376 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:46:37,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:46:37,376 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:46:37,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:46:37,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2067119317, now seen corresponding path program 1 times [2025-01-09 09:46:37,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:46:37,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976104283] [2025-01-09 09:46:37,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:37,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:46:37,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-01-09 09:46:37,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-01-09 09:46:37,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:37,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:46:38,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:46:38,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976104283] [2025-01-09 09:46:38,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976104283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:46:38,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:46:38,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:46:38,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538352849] [2025-01-09 09:46:38,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:46:38,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:46:38,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:46:38,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:46:38,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:46:38,163 INFO L87 Difference]: Start difference. First operand 713 states and 1163 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:46:39,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:46:39,351 INFO L93 Difference]: Finished difference Result 2132 states and 3458 transitions. [2025-01-09 09:46:39,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:46:39,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 448 [2025-01-09 09:46:39,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:46:39,366 INFO L225 Difference]: With dead ends: 2132 [2025-01-09 09:46:39,366 INFO L226 Difference]: Without dead ends: 1422 [2025-01-09 09:46:39,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:46:39,370 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 1177 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:46:39,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 1223 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 09:46:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-01-09 09:46:39,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1408. [2025-01-09 09:46:39,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1011 states have (on average 1.4975272007912956) internal successors, (1514), 1019 states have internal predecessors, (1514), 386 states have call successors, (386), 10 states have call predecessors, (386), 10 states have return successors, (386), 378 states have call predecessors, (386), 386 states have call successors, (386) [2025-01-09 09:46:39,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 2286 transitions. [2025-01-09 09:46:39,488 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 2286 transitions. Word has length 448 [2025-01-09 09:46:39,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:46:39,489 INFO L471 AbstractCegarLoop]: Abstraction has 1408 states and 2286 transitions. [2025-01-09 09:46:39,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:46:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 2286 transitions. [2025-01-09 09:46:39,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-01-09 09:46:39,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:46:39,495 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:46:39,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:46:39,495 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:46:39,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:46:39,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1383842477, now seen corresponding path program 1 times [2025-01-09 09:46:39,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:46:39,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023470117] [2025-01-09 09:46:39,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:39,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:46:39,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-01-09 09:46:39,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-01-09 09:46:39,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:39,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:40,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:46:40,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:46:40,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023470117] [2025-01-09 09:46:40,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023470117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:46:40,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:46:40,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 09:46:40,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067123302] [2025-01-09 09:46:40,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:46:40,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 09:46:40,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:46:40,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 09:46:40,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:46:40,505 INFO L87 Difference]: Start difference. First operand 1408 states and 2286 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 3 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 3 states have call predecessors, (69), 3 states have call successors, (69) [2025-01-09 09:46:42,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:46:42,571 INFO L93 Difference]: Finished difference Result 4637 states and 7486 transitions. [2025-01-09 09:46:42,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:46:42,572 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 3 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 3 states have call predecessors, (69), 3 states have call successors, (69) Word has length 448 [2025-01-09 09:46:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:46:42,592 INFO L225 Difference]: With dead ends: 4637 [2025-01-09 09:46:42,592 INFO L226 Difference]: Without dead ends: 3232 [2025-01-09 09:46:42,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2025-01-09 09:46:42,598 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 1474 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 630 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 630 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:46:42,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1604 Invalid, 2168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [630 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 09:46:42,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2025-01-09 09:46:42,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 2613. [2025-01-09 09:46:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2613 states, 1870 states have (on average 1.4828877005347594) internal successors, (2773), 1887 states have internal predecessors, (2773), 717 states have call successors, (717), 25 states have call predecessors, (717), 25 states have return successors, (717), 700 states have call predecessors, (717), 717 states have call successors, (717) [2025-01-09 09:46:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2613 states to 2613 states and 4207 transitions. [2025-01-09 09:46:42,807 INFO L78 Accepts]: Start accepts. Automaton has 2613 states and 4207 transitions. Word has length 448 [2025-01-09 09:46:42,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:46:42,809 INFO L471 AbstractCegarLoop]: Abstraction has 2613 states and 4207 transitions. [2025-01-09 09:46:42,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 3 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 3 states have call predecessors, (69), 3 states have call successors, (69) [2025-01-09 09:46:42,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2613 states and 4207 transitions. [2025-01-09 09:46:42,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-01-09 09:46:42,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:46:42,813 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:46:42,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:46:42,813 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:46:42,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:46:42,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1818972823, now seen corresponding path program 1 times [2025-01-09 09:46:42,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:46:42,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418042869] [2025-01-09 09:46:42,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:42,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:46:42,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-01-09 09:46:42,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-01-09 09:46:42,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:42,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:43,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:46:43,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:46:43,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418042869] [2025-01-09 09:46:43,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418042869] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:46:43,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:46:43,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 09:46:43,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119615322] [2025-01-09 09:46:43,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:46:43,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:46:43,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:46:43,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:46:43,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:46:43,526 INFO L87 Difference]: Start difference. First operand 2613 states and 4207 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 3 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 3 states have call predecessors, (69), 3 states have call successors, (69) [2025-01-09 09:46:44,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:46:44,638 INFO L93 Difference]: Finished difference Result 5161 states and 8294 transitions. [2025-01-09 09:46:44,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 09:46:44,638 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 3 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 3 states have call predecessors, (69), 3 states have call successors, (69) Word has length 448 [2025-01-09 09:46:44,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:46:44,660 INFO L225 Difference]: With dead ends: 5161 [2025-01-09 09:46:44,661 INFO L226 Difference]: Without dead ends: 2673 [2025-01-09 09:46:44,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:46:44,669 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 897 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:46:44,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 1943 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:46:44,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2025-01-09 09:46:44,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2380. [2025-01-09 09:46:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 1710 states have (on average 1.4865497076023393) internal successors, (2542), 1725 states have internal predecessors, (2542), 645 states have call successors, (645), 24 states have call predecessors, (645), 24 states have return successors, (645), 630 states have call predecessors, (645), 645 states have call successors, (645) [2025-01-09 09:46:44,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3832 transitions. [2025-01-09 09:46:44,867 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3832 transitions. Word has length 448 [2025-01-09 09:46:44,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:46:44,869 INFO L471 AbstractCegarLoop]: Abstraction has 2380 states and 3832 transitions. [2025-01-09 09:46:44,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 3 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 3 states have call predecessors, (69), 3 states have call successors, (69) [2025-01-09 09:46:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3832 transitions. [2025-01-09 09:46:44,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-01-09 09:46:44,873 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:46:44,873 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:46:44,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:46:44,873 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:46:44,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:46:44,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1631988971, now seen corresponding path program 1 times [2025-01-09 09:46:44,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:46:44,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914563133] [2025-01-09 09:46:44,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:44,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:46:44,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-01-09 09:46:45,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-01-09 09:46:45,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:45,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 96 proven. 108 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-01-09 09:46:45,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:46:45,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914563133] [2025-01-09 09:46:45,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914563133] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:46:45,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642154669] [2025-01-09 09:46:45,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:45,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:46:45,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:46:45,439 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 09:46:45,442 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 09:46:45,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-01-09 09:46:45,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-01-09 09:46:45,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:45,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:45,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 09:46:45,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:46:45,905 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 4110 proven. 63 refuted. 0 times theorem prover too weak. 5211 trivial. 0 not checked. [2025-01-09 09:46:45,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:46:46,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 141 proven. 63 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-01-09 09:46:46,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642154669] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:46:46,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:46:46,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-01-09 09:46:46,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826095189] [2025-01-09 09:46:46,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:46:46,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 09:46:46,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:46:46,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 09:46:46,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:46:46,356 INFO L87 Difference]: Start difference. First operand 2380 states and 3832 transitions. Second operand has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 3 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (128), 3 states have call predecessors, (128), 3 states have call successors, (128) [2025-01-09 09:46:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:46:47,233 INFO L93 Difference]: Finished difference Result 3873 states and 6189 transitions. [2025-01-09 09:46:47,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 09:46:47,234 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 3 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (128), 3 states have call predecessors, (128), 3 states have call successors, (128) Word has length 448 [2025-01-09 09:46:47,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:46:47,249 INFO L225 Difference]: With dead ends: 3873 [2025-01-09 09:46:47,250 INFO L226 Difference]: Without dead ends: 1622 [2025-01-09 09:46:47,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 894 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2025-01-09 09:46:47,258 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 581 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:46:47,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 1015 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 09:46:47,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2025-01-09 09:46:47,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1586. [2025-01-09 09:46:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1586 states, 1104 states have (on average 1.4393115942028984) internal successors, (1589), 1113 states have internal predecessors, (1589), 455 states have call successors, (455), 26 states have call predecessors, (455), 26 states have return successors, (455), 446 states have call predecessors, (455), 455 states have call successors, (455) [2025-01-09 09:46:47,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2499 transitions. [2025-01-09 09:46:47,415 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2499 transitions. Word has length 448 [2025-01-09 09:46:47,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:46:47,416 INFO L471 AbstractCegarLoop]: Abstraction has 1586 states and 2499 transitions. [2025-01-09 09:46:47,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 3 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (128), 3 states have call predecessors, (128), 3 states have call successors, (128) [2025-01-09 09:46:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2499 transitions. [2025-01-09 09:46:47,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-01-09 09:46:47,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:46:47,421 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:46:47,430 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 09:46:47,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:46:47,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:46:47,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:46:47,624 INFO L85 PathProgramCache]: Analyzing trace with hash 855812869, now seen corresponding path program 1 times [2025-01-09 09:46:47,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:46:47,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131645608] [2025-01-09 09:46:47,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:47,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:46:47,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-01-09 09:46:47,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-01-09 09:46:47,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:47,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:50,123 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:46:50,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:46:50,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131645608] [2025-01-09 09:46:50,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131645608] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:46:50,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:46:50,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 09:46:50,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590381585] [2025-01-09 09:46:50,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:46:50,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 09:46:50,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:46:50,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 09:46:50,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:46:50,126 INFO L87 Difference]: Start difference. First operand 1586 states and 2499 transitions. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 3 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 3 states have call predecessors, (69), 3 states have call successors, (69) [2025-01-09 09:46:54,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:46:54,495 INFO L93 Difference]: Finished difference Result 6326 states and 10053 transitions. [2025-01-09 09:46:54,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 09:46:54,496 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 3 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 3 states have call predecessors, (69), 3 states have call successors, (69) Word has length 450 [2025-01-09 09:46:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:46:54,516 INFO L225 Difference]: With dead ends: 6326 [2025-01-09 09:46:54,516 INFO L226 Difference]: Without dead ends: 4877 [2025-01-09 09:46:54,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2025-01-09 09:46:54,522 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 4090 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 1394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4090 SdHoareTripleChecker+Valid, 2353 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1394 IncrementalHoareTripleChecker+Valid, 1947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:46:54,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4090 Valid, 2353 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1394 Valid, 1947 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-09 09:46:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4877 states. [2025-01-09 09:46:54,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4877 to 1818. [2025-01-09 09:46:54,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1329 states have (on average 1.4785553047404063) internal successors, (1965), 1338 states have internal predecessors, (1965), 455 states have call successors, (455), 33 states have call predecessors, (455), 33 states have return successors, (455), 446 states have call predecessors, (455), 455 states have call successors, (455) [2025-01-09 09:46:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2875 transitions. [2025-01-09 09:46:54,749 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 2875 transitions. Word has length 450 [2025-01-09 09:46:54,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:46:54,750 INFO L471 AbstractCegarLoop]: Abstraction has 1818 states and 2875 transitions. [2025-01-09 09:46:54,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 3 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 3 states have call predecessors, (69), 3 states have call successors, (69) [2025-01-09 09:46:54,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2875 transitions. [2025-01-09 09:46:54,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-01-09 09:46:54,753 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:46:54,753 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:46:54,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:46:54,753 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:46:54,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:46:54,754 INFO L85 PathProgramCache]: Analyzing trace with hash 352786377, now seen corresponding path program 1 times [2025-01-09 09:46:54,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:46:54,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140711468] [2025-01-09 09:46:54,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:54,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:46:54,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-01-09 09:46:54,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-01-09 09:46:54,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:54,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:46:55,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:46:55,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140711468] [2025-01-09 09:46:55,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140711468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:46:55,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:46:55,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 09:46:55,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064492450] [2025-01-09 09:46:55,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:46:55,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 09:46:55,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:46:55,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 09:46:55,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:46:55,336 INFO L87 Difference]: Start difference. First operand 1818 states and 2875 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:46:56,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:46:56,997 INFO L93 Difference]: Finished difference Result 5596 states and 8855 transitions. [2025-01-09 09:46:56,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:46:56,999 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 450 [2025-01-09 09:46:56,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:46:57,013 INFO L225 Difference]: With dead ends: 5596 [2025-01-09 09:46:57,013 INFO L226 Difference]: Without dead ends: 3919 [2025-01-09 09:46:57,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-01-09 09:46:57,017 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 1472 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 431 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1927 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 431 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:46:57,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1927 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [431 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 09:46:57,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2025-01-09 09:46:57,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 2887. [2025-01-09 09:46:57,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2887 states, 2154 states have (on average 1.4897864438254411) internal successors, (3209), 2168 states have internal predecessors, (3209), 682 states have call successors, (682), 50 states have call predecessors, (682), 50 states have return successors, (682), 668 states have call predecessors, (682), 682 states have call successors, (682) [2025-01-09 09:46:57,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 4573 transitions. [2025-01-09 09:46:57,290 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 4573 transitions. Word has length 450 [2025-01-09 09:46:57,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:46:57,290 INFO L471 AbstractCegarLoop]: Abstraction has 2887 states and 4573 transitions. [2025-01-09 09:46:57,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:46:57,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 4573 transitions. [2025-01-09 09:46:57,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-01-09 09:46:57,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:46:57,322 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:46:57,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:46:57,322 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:46:57,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:46:57,323 INFO L85 PathProgramCache]: Analyzing trace with hash -41580409, now seen corresponding path program 1 times [2025-01-09 09:46:57,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:46:57,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056219725] [2025-01-09 09:46:57,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:57,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:46:57,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-01-09 09:46:57,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-01-09 09:46:57,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:57,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 96 proven. 108 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-01-09 09:46:59,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:46:59,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056219725] [2025-01-09 09:46:59,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056219725] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:46:59,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678347124] [2025-01-09 09:46:59,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:59,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:46:59,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:46:59,949 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 09:46:59,959 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 09:47:00,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-01-09 09:47:00,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-01-09 09:47:00,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:47:00,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:47:00,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 09:47:00,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:47:02,077 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 4916 proven. 207 refuted. 0 times theorem prover too weak. 4261 trivial. 0 not checked. [2025-01-09 09:47:02,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:47:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 96 proven. 108 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-01-09 09:47:04,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678347124] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:47:04,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:47:04,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 45 [2025-01-09 09:47:04,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117120445] [2025-01-09 09:47:04,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:47:04,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-01-09 09:47:04,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:47:04,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-01-09 09:47:04,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1716, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 09:47:04,334 INFO L87 Difference]: Start difference. First operand 2887 states and 4573 transitions. Second operand has 45 states, 45 states have (on average 5.8) internal successors, (261), 45 states have internal predecessors, (261), 7 states have call successors, (207), 4 states have call predecessors, (207), 8 states have return successors, (207), 7 states have call predecessors, (207), 7 states have call successors, (207) [2025-01-09 09:47:50,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:47:50,623 INFO L93 Difference]: Finished difference Result 42301 states and 65943 transitions. [2025-01-09 09:47:50,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 438 states. [2025-01-09 09:47:50,624 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 5.8) internal successors, (261), 45 states have internal predecessors, (261), 7 states have call successors, (207), 4 states have call predecessors, (207), 8 states have return successors, (207), 7 states have call predecessors, (207), 7 states have call successors, (207) Word has length 450 [2025-01-09 09:47:50,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:47:50,784 INFO L225 Difference]: With dead ends: 42301 [2025-01-09 09:47:50,785 INFO L226 Difference]: Without dead ends: 39555 [2025-01-09 09:47:50,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1434 GetRequests, 971 SyntacticMatches, 0 SemanticMatches, 463 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99334 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=33448, Invalid=182312, Unknown=0, NotChecked=0, Total=215760 [2025-01-09 09:47:50,827 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 24041 mSDsluCounter, 12118 mSDsCounter, 0 mSdLazyCounter, 15902 mSolverCounterSat, 9452 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24234 SdHoareTripleChecker+Valid, 12577 SdHoareTripleChecker+Invalid, 25354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 9452 IncrementalHoareTripleChecker+Valid, 15902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:47:50,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24234 Valid, 12577 Invalid, 25354 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [9452 Valid, 15902 Invalid, 0 Unknown, 0 Unchecked, 17.0s Time] [2025-01-09 09:47:50,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39555 states. [2025-01-09 09:47:52,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39555 to 12680. [2025-01-09 09:47:52,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12680 states, 9817 states have (on average 1.5085056534582866) internal successors, (14809), 9884 states have internal predecessors, (14809), 2668 states have call successors, (2668), 194 states have call predecessors, (2668), 194 states have return successors, (2668), 2601 states have call predecessors, (2668), 2668 states have call successors, (2668) [2025-01-09 09:47:52,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12680 states to 12680 states and 20145 transitions. [2025-01-09 09:47:53,010 INFO L78 Accepts]: Start accepts. Automaton has 12680 states and 20145 transitions. Word has length 450 [2025-01-09 09:47:53,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:47:53,010 INFO L471 AbstractCegarLoop]: Abstraction has 12680 states and 20145 transitions. [2025-01-09 09:47:53,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 5.8) internal successors, (261), 45 states have internal predecessors, (261), 7 states have call successors, (207), 4 states have call predecessors, (207), 8 states have return successors, (207), 7 states have call predecessors, (207), 7 states have call successors, (207) [2025-01-09 09:47:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 12680 states and 20145 transitions. [2025-01-09 09:47:53,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-01-09 09:47:53,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:47:53,019 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:47:53,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 09:47:53,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 09:47:53,220 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:47:53,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:47:53,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1220333773, now seen corresponding path program 1 times [2025-01-09 09:47:53,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:47:53,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960814670] [2025-01-09 09:47:53,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:47:53,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:47:53,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-01-09 09:47:53,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-01-09 09:47:53,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:47:53,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:47:53,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:47:53,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:47:53,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960814670] [2025-01-09 09:47:53,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960814670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:47:53,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:47:53,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:47:53,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041224049] [2025-01-09 09:47:53,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:47:53,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:47:53,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:47:53,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:47:53,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:47:53,454 INFO L87 Difference]: Start difference. First operand 12680 states and 20145 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:47:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:47:55,739 INFO L93 Difference]: Finished difference Result 30733 states and 48869 transitions. [2025-01-09 09:47:55,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:47:55,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 450 [2025-01-09 09:47:55,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:47:55,796 INFO L225 Difference]: With dead ends: 30733 [2025-01-09 09:47:55,796 INFO L226 Difference]: Without dead ends: 18202 [2025-01-09 09:47:55,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:47:55,821 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 433 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:47:55,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1234 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:47:55,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18202 states.