./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-28.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 1759abcdcdacb11ff4424134b4ed938cccdebafbf4e21a4bd94aebb869ddee2f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:38:39,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:38:39,408 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:38:39,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:38:39,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:38:39,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:38:39,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:38:39,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:38:39,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:38:39,440 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:38:39,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:38:39,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:38:39,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:38:39,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:38:39,441 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:38:39,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:38:39,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:38:39,442 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:38:39,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:38:39,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:38:39,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:38:39,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:38:39,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:38:39,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:38:39,442 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:38:39,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:38:39,442 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:38:39,442 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:38:39,443 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:38:39,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:38:39,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:38:39,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:38:39,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:38:39,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:38:39,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:38:39,444 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:38:39,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:38:39,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:38:39,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:38:39,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:38:39,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:38:39,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:38:39,444 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:38:39,444 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 -> 1759abcdcdacb11ff4424134b4ed938cccdebafbf4e21a4bd94aebb869ddee2f [2025-02-06 02:38:39,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:38:39,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:38:39,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:38:39,674 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:38:39,674 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:38:39,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-28.i [2025-02-06 02:38:40,893 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1486813e/65b0b006ff184d63aaaecf2c071eb9fc/FLAG686e1f3df [2025-02-06 02:38:41,257 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:38:41,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-28.i [2025-02-06 02:38:41,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1486813e/65b0b006ff184d63aaaecf2c071eb9fc/FLAG686e1f3df [2025-02-06 02:38:41,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1486813e/65b0b006ff184d63aaaecf2c071eb9fc [2025-02-06 02:38:41,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:38:41,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:38:41,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:38:41,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:38:41,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:38:41,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:38:41" (1/1) ... [2025-02-06 02:38:41,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137ce0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:41, skipping insertion in model container [2025-02-06 02:38:41,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:38:41" (1/1) ... [2025-02-06 02:38:41,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:38:41,429 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-28.i[916,929] [2025-02-06 02:38:41,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:38:41,651 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:38:41,659 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-28.i[916,929] [2025-02-06 02:38:41,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:38:41,848 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:38:41,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:41 WrapperNode [2025-02-06 02:38:41,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:38:41,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:38:41,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:38:41,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:38:41,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:41" (1/1) ... [2025-02-06 02:38:41,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:41" (1/1) ... [2025-02-06 02:38:42,082 INFO L138 Inliner]: procedures = 26, calls = 84, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 882 [2025-02-06 02:38:42,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:38:42,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:38:42,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:38:42,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:38:42,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:41" (1/1) ... [2025-02-06 02:38:42,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:41" (1/1) ... [2025-02-06 02:38:42,117 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:41" (1/1) ... [2025-02-06 02:38:42,221 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-02-06 02:38:42,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:41" (1/1) ... [2025-02-06 02:38:42,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:41" (1/1) ... [2025-02-06 02:38:42,252 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:41" (1/1) ... [2025-02-06 02:38:42,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:41" (1/1) ... [2025-02-06 02:38:42,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:41" (1/1) ... [2025-02-06 02:38:42,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:41" (1/1) ... [2025-02-06 02:38:42,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:38:42,299 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:38:42,299 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:38:42,300 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:38:42,300 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:41" (1/1) ... [2025-02-06 02:38:42,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:38:42,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:38:42,325 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-02-06 02:38:42,327 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-02-06 02:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:38:42,342 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:38:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:38:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:38:42,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:38:42,433 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:38:42,435 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:38:43,494 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L643: havoc property_#t~ite57#1;havoc property_#t~ite56#1;havoc property_#t~bitwise55#1;havoc property_#t~ite62#1;havoc property_#t~ite61#1;havoc property_#t~ite60#1;havoc property_#t~ite59#1;havoc property_#t~bitwise58#1;havoc property_#t~short63#1;havoc property_#t~bitwise64#1;havoc property_#t~ite66#1;havoc property_#t~bitwise65#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~ite69#1;havoc property_#t~bitwise68#1;havoc property_#t~short71#1;havoc property_#t~ite73#1;havoc property_#t~bitwise72#1;havoc property_#t~short74#1;havoc property_#t~bitwise75#1;havoc property_#t~short76#1;havoc property_#t~ite78#1;havoc property_#t~bitwise77#1;havoc property_#t~short79#1;havoc property_#t~bitwise80#1;havoc property_#t~short81#1;havoc property_#t~bitwise82#1;havoc property_#t~short83#1;havoc property_#t~bitwise84#1;havoc property_#t~short85#1; [2025-02-06 02:38:43,671 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2025-02-06 02:38:43,671 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:38:43,711 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:38:43,711 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:38:43,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:38:43 BoogieIcfgContainer [2025-02-06 02:38:43,712 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:38:43,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:38:43,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:38:43,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:38:43,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:38:41" (1/3) ... [2025-02-06 02:38:43,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d5e0b9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:38:43, skipping insertion in model container [2025-02-06 02:38:43,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:41" (2/3) ... [2025-02-06 02:38:43,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d5e0b9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:38:43, skipping insertion in model container [2025-02-06 02:38:43,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:38:43" (3/3) ... [2025-02-06 02:38:43,722 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-28.i [2025-02-06 02:38:43,732 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:38:43,738 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-28.i that has 2 procedures, 356 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:38:43,805 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:38:43,813 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;@515e58e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:38:43,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:38:43,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 356 states, 282 states have (on average 1.5283687943262412) internal successors, (431), 283 states have internal predecessors, (431), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-06 02:38:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-02-06 02:38:43,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:43,836 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:43,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:43,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:43,840 INFO L85 PathProgramCache]: Analyzing trace with hash -779841483, now seen corresponding path program 1 times [2025-02-06 02:38:43,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:43,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274955965] [2025-02-06 02:38:43,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:43,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:43,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-02-06 02:38:43,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-02-06 02:38:43,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:43,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:44,380 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2025-02-06 02:38:44,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:44,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274955965] [2025-02-06 02:38:44,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274955965] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:38:44,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984483853] [2025-02-06 02:38:44,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:44,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:38:44,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:38:44,385 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-02-06 02:38:44,386 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-02-06 02:38:44,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-02-06 02:38:44,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-02-06 02:38:44,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:44,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:44,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 1249 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:38:44,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:38:44,826 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2025-02-06 02:38:44,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:38:44,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984483853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:44,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:38:44,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:38:44,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662127840] [2025-02-06 02:38:44,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:44,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:38:44,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:44,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:38:44,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:38:44,855 INFO L87 Difference]: Start difference. First operand has 356 states, 282 states have (on average 1.5283687943262412) internal successors, (431), 283 states have internal predecessors, (431), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2025-02-06 02:38:44,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:44,932 INFO L93 Difference]: Finished difference Result 703 states and 1208 transitions. [2025-02-06 02:38:44,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:38:44,935 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) Word has length 502 [2025-02-06 02:38:44,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:44,944 INFO L225 Difference]: With dead ends: 703 [2025-02-06 02:38:44,944 INFO L226 Difference]: Without dead ends: 350 [2025-02-06 02:38:44,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 503 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-02-06 02:38:44,950 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:44,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 540 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:38:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-02-06 02:38:44,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2025-02-06 02:38:44,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 277 states have (on average 1.5090252707581226) internal successors, (418), 277 states have internal predecessors, (418), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-06 02:38:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 560 transitions. [2025-02-06 02:38:45,005 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 560 transitions. Word has length 502 [2025-02-06 02:38:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:45,006 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 560 transitions. [2025-02-06 02:38:45,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2025-02-06 02:38:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 560 transitions. [2025-02-06 02:38:45,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-02-06 02:38:45,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:45,015 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:45,024 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-02-06 02:38:45,216 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-02-06 02:38:45,216 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:45,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:45,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1254167718, now seen corresponding path program 1 times [2025-02-06 02:38:45,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:45,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436332572] [2025-02-06 02:38:45,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:45,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:45,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-02-06 02:38:45,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-02-06 02:38:45,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:45,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:38:45,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:45,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436332572] [2025-02-06 02:38:45,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436332572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:45,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:45,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:38:45,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838669255] [2025-02-06 02:38:45,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:45,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:38:45,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:45,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:38:45,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:45,966 INFO L87 Difference]: Start difference. First operand 350 states and 560 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:38:46,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:46,087 INFO L93 Difference]: Finished difference Result 909 states and 1456 transitions. [2025-02-06 02:38:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:38:46,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 502 [2025-02-06 02:38:46,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:46,102 INFO L225 Difference]: With dead ends: 909 [2025-02-06 02:38:46,102 INFO L226 Difference]: Without dead ends: 562 [2025-02-06 02:38:46,103 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-02-06 02:38:46,103 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 333 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:46,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1066 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:38:46,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-02-06 02:38:46,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 494. [2025-02-06 02:38:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 421 states have (on average 1.5629453681710215) internal successors, (658), 421 states have internal predecessors, (658), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-06 02:38:46,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 800 transitions. [2025-02-06 02:38:46,149 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 800 transitions. Word has length 502 [2025-02-06 02:38:46,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:46,153 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 800 transitions. [2025-02-06 02:38:46,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:38:46,153 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 800 transitions. [2025-02-06 02:38:46,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-02-06 02:38:46,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:46,157 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:46,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:38:46,157 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:46,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:46,158 INFO L85 PathProgramCache]: Analyzing trace with hash -299417402, now seen corresponding path program 1 times [2025-02-06 02:38:46,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:46,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210092271] [2025-02-06 02:38:46,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:46,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:46,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-02-06 02:38:46,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-02-06 02:38:46,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:46,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:38:46,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:46,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210092271] [2025-02-06 02:38:46,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210092271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:46,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:46,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:38:46,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204934806] [2025-02-06 02:38:46,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:46,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:38:46,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:46,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:38:46,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:46,629 INFO L87 Difference]: Start difference. First operand 494 states and 800 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:38:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:46,708 INFO L93 Difference]: Finished difference Result 1053 states and 1694 transitions. [2025-02-06 02:38:46,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:38:46,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 503 [2025-02-06 02:38:46,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:46,712 INFO L225 Difference]: With dead ends: 1053 [2025-02-06 02:38:46,712 INFO L226 Difference]: Without dead ends: 562 [2025-02-06 02:38:46,713 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-02-06 02:38:46,714 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 353 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:46,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 1047 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:38:46,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-02-06 02:38:46,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 494. [2025-02-06 02:38:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 421 states have (on average 1.5581947743467934) internal successors, (656), 421 states have internal predecessors, (656), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-06 02:38:46,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 798 transitions. [2025-02-06 02:38:46,732 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 798 transitions. Word has length 503 [2025-02-06 02:38:46,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:46,732 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 798 transitions. [2025-02-06 02:38:46,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:38:46,733 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 798 transitions. [2025-02-06 02:38:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-02-06 02:38:46,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:46,736 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:46,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:38:46,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:46,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:46,740 INFO L85 PathProgramCache]: Analyzing trace with hash -741171897, now seen corresponding path program 1 times [2025-02-06 02:38:46,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:46,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60484653] [2025-02-06 02:38:46,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:46,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:46,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-02-06 02:38:46,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-02-06 02:38:46,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:46,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:38:47,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:47,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60484653] [2025-02-06 02:38:47,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60484653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:47,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:47,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:38:47,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655172321] [2025-02-06 02:38:47,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:47,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:38:47,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:47,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:38:47,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:47,276 INFO L87 Difference]: Start difference. First operand 494 states and 798 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:38:47,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:47,368 INFO L93 Difference]: Finished difference Result 985 states and 1593 transitions. [2025-02-06 02:38:47,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:38:47,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 503 [2025-02-06 02:38:47,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:47,374 INFO L225 Difference]: With dead ends: 985 [2025-02-06 02:38:47,375 INFO L226 Difference]: Without dead ends: 494 [2025-02-06 02:38:47,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:47,376 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 0 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:47,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1059 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:38:47,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-02-06 02:38:47,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2025-02-06 02:38:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 421 states have (on average 1.5534441805225654) internal successors, (654), 421 states have internal predecessors, (654), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-06 02:38:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 796 transitions. [2025-02-06 02:38:47,410 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 796 transitions. Word has length 503 [2025-02-06 02:38:47,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:47,411 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 796 transitions. [2025-02-06 02:38:47,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:38:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 796 transitions. [2025-02-06 02:38:47,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-02-06 02:38:47,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:47,416 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:47,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:38:47,417 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:47,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:47,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1092614491, now seen corresponding path program 1 times [2025-02-06 02:38:47,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:47,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871752657] [2025-02-06 02:38:47,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:47,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:47,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-02-06 02:38:47,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-02-06 02:38:47,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:47,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:38:47,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:47,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871752657] [2025-02-06 02:38:47,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871752657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:47,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:47,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:38:47,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677253538] [2025-02-06 02:38:47,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:47,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:38:47,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:47,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:38:47,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:38:47,982 INFO L87 Difference]: Start difference. First operand 494 states and 796 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:38:48,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:48,231 INFO L93 Difference]: Finished difference Result 989 states and 1592 transitions. [2025-02-06 02:38:48,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:38:48,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 505 [2025-02-06 02:38:48,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:48,236 INFO L225 Difference]: With dead ends: 989 [2025-02-06 02:38:48,236 INFO L226 Difference]: Without dead ends: 498 [2025-02-06 02:38:48,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:38:48,238 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 377 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:48,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1652 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:38:48,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-02-06 02:38:48,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2025-02-06 02:38:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 424 states have (on average 1.544811320754717) internal successors, (655), 424 states have internal predecessors, (655), 71 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-06 02:38:48,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 797 transitions. [2025-02-06 02:38:48,270 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 797 transitions. Word has length 505 [2025-02-06 02:38:48,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:48,271 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 797 transitions. [2025-02-06 02:38:48,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:38:48,271 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 797 transitions. [2025-02-06 02:38:48,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-02-06 02:38:48,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:48,274 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:48,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:38:48,274 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:48,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:48,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1027672708, now seen corresponding path program 1 times [2025-02-06 02:38:48,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:48,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087324342] [2025-02-06 02:38:48,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:48,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:48,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-02-06 02:38:48,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-02-06 02:38:48,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:48,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:38:48,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:48,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087324342] [2025-02-06 02:38:48,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087324342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:48,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:48,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:38:48,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542923539] [2025-02-06 02:38:48,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:48,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:38:48,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:48,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:38:48,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:48,932 INFO L87 Difference]: Start difference. First operand 498 states and 797 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:38:49,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:49,072 INFO L93 Difference]: Finished difference Result 1488 states and 2385 transitions. [2025-02-06 02:38:49,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:38:49,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 505 [2025-02-06 02:38:49,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:49,080 INFO L225 Difference]: With dead ends: 1488 [2025-02-06 02:38:49,080 INFO L226 Difference]: Without dead ends: 993 [2025-02-06 02:38:49,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-06 02:38:49,082 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 502 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:49,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 1840 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:38:49,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2025-02-06 02:38:49,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 702. [2025-02-06 02:38:49,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 628 states have (on average 1.5812101910828025) internal successors, (993), 628 states have internal predecessors, (993), 71 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-06 02:38:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1135 transitions. [2025-02-06 02:38:49,121 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1135 transitions. Word has length 505 [2025-02-06 02:38:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:49,122 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1135 transitions. [2025-02-06 02:38:49,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:38:49,122 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1135 transitions. [2025-02-06 02:38:49,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-02-06 02:38:49,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:49,126 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:49,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:38:49,126 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:49,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:49,128 INFO L85 PathProgramCache]: Analyzing trace with hash -457382843, now seen corresponding path program 1 times [2025-02-06 02:38:49,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:49,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975634371] [2025-02-06 02:38:49,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:49,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:49,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-02-06 02:38:49,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-02-06 02:38:49,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:49,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:49,369 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:38:49,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:49,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975634371] [2025-02-06 02:38:49,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975634371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:49,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:49,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:38:49,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335282915] [2025-02-06 02:38:49,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:49,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:38:49,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:49,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:38:49,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:49,372 INFO L87 Difference]: Start difference. First operand 702 states and 1135 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:38:49,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:49,504 INFO L93 Difference]: Finished difference Result 1730 states and 2782 transitions. [2025-02-06 02:38:49,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:38:49,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 505 [2025-02-06 02:38:49,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:49,512 INFO L225 Difference]: With dead ends: 1730 [2025-02-06 02:38:49,512 INFO L226 Difference]: Without dead ends: 1031 [2025-02-06 02:38:49,513 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-02-06 02:38:49,514 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 522 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:49,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1274 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:38:49,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2025-02-06 02:38:49,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 828. [2025-02-06 02:38:49,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 754 states have (on average 1.570291777188329) internal successors, (1184), 754 states have internal predecessors, (1184), 71 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-06 02:38:49,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1326 transitions. [2025-02-06 02:38:49,553 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1326 transitions. Word has length 505 [2025-02-06 02:38:49,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:49,554 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1326 transitions. [2025-02-06 02:38:49,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:38:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1326 transitions. [2025-02-06 02:38:49,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-02-06 02:38:49,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:49,559 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:49,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:38:49,559 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:49,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:49,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1666625082, now seen corresponding path program 1 times [2025-02-06 02:38:49,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:49,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569762871] [2025-02-06 02:38:49,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:49,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:49,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-02-06 02:38:49,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-02-06 02:38:49,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:49,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:38:49,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:49,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569762871] [2025-02-06 02:38:49,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569762871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:49,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:49,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:38:49,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185475076] [2025-02-06 02:38:49,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:49,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:38:49,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:49,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:38:49,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:49,758 INFO L87 Difference]: Start difference. First operand 828 states and 1326 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:38:49,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:49,888 INFO L93 Difference]: Finished difference Result 1800 states and 2872 transitions. [2025-02-06 02:38:49,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:38:49,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 505 [2025-02-06 02:38:49,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:49,893 INFO L225 Difference]: With dead ends: 1800 [2025-02-06 02:38:49,893 INFO L226 Difference]: Without dead ends: 975 [2025-02-06 02:38:49,894 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-02-06 02:38:49,895 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 495 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:49,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 1307 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:38:49,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-02-06 02:38:49,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 772. [2025-02-06 02:38:49,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 698 states have (on average 1.5515759312320916) internal successors, (1083), 698 states have internal predecessors, (1083), 71 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-06 02:38:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1225 transitions. [2025-02-06 02:38:49,923 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1225 transitions. Word has length 505 [2025-02-06 02:38:49,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:49,923 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1225 transitions. [2025-02-06 02:38:49,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:38:49,924 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1225 transitions. [2025-02-06 02:38:49,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-02-06 02:38:49,926 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:49,927 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:49,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:38:49,927 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:49,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash 105493144, now seen corresponding path program 1 times [2025-02-06 02:38:49,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:49,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882527045] [2025-02-06 02:38:49,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:49,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:49,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-02-06 02:38:50,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-02-06 02:38:50,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:50,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:50,745 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:38:50,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:50,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882527045] [2025-02-06 02:38:50,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882527045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:50,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:50,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:38:50,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296050579] [2025-02-06 02:38:50,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:50,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:38:50,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:50,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:38:50,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:50,747 INFO L87 Difference]: Start difference. First operand 772 states and 1225 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:38:50,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:50,884 INFO L93 Difference]: Finished difference Result 1896 states and 2985 transitions. [2025-02-06 02:38:50,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:38:50,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 506 [2025-02-06 02:38:50,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:50,890 INFO L225 Difference]: With dead ends: 1896 [2025-02-06 02:38:50,890 INFO L226 Difference]: Without dead ends: 1127 [2025-02-06 02:38:50,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-02-06 02:38:50,894 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 288 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:50,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1143 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:38:50,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2025-02-06 02:38:50,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1124. [2025-02-06 02:38:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 1010 states have (on average 1.5237623762376238) internal successors, (1539), 1011 states have internal predecessors, (1539), 109 states have call successors, (109), 4 states have call predecessors, (109), 4 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-06 02:38:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1757 transitions. [2025-02-06 02:38:50,936 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1757 transitions. Word has length 506 [2025-02-06 02:38:50,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:50,936 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1757 transitions. [2025-02-06 02:38:50,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:38:50,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1757 transitions. [2025-02-06 02:38:50,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-02-06 02:38:50,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:50,941 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:50,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:38:50,942 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:50,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:50,942 INFO L85 PathProgramCache]: Analyzing trace with hash -919200777, now seen corresponding path program 1 times [2025-02-06 02:38:50,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:50,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922816176] [2025-02-06 02:38:50,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:50,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:50,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-02-06 02:38:51,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-02-06 02:38:51,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:51,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:38:51,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:51,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922816176] [2025-02-06 02:38:51,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922816176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:51,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:51,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:38:51,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509242945] [2025-02-06 02:38:51,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:51,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:38:51,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:51,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:38:51,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:51,784 INFO L87 Difference]: Start difference. First operand 1124 states and 1757 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:38:51,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:51,944 INFO L93 Difference]: Finished difference Result 2245 states and 3511 transitions. [2025-02-06 02:38:51,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:38:51,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 506 [2025-02-06 02:38:51,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:51,952 INFO L225 Difference]: With dead ends: 2245 [2025-02-06 02:38:51,952 INFO L226 Difference]: Without dead ends: 1124 [2025-02-06 02:38:51,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:51,955 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 0 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:51,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1542 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:38:51,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2025-02-06 02:38:51,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1124. [2025-02-06 02:38:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 1010 states have (on average 1.5198019801980198) internal successors, (1535), 1011 states have internal predecessors, (1535), 109 states have call successors, (109), 4 states have call predecessors, (109), 4 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-06 02:38:51,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1753 transitions. [2025-02-06 02:38:51,999 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1753 transitions. Word has length 506 [2025-02-06 02:38:51,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:51,999 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1753 transitions. [2025-02-06 02:38:51,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:38:51,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1753 transitions. [2025-02-06 02:38:52,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-02-06 02:38:52,004 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:52,004 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:52,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:38:52,004 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:52,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:52,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1051738680, now seen corresponding path program 1 times [2025-02-06 02:38:52,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:52,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66927844] [2025-02-06 02:38:52,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:52,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:52,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-02-06 02:38:53,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-02-06 02:38:53,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:53,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:39:23,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:23,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66927844] [2025-02-06 02:39:23,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66927844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:23,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:23,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:39:23,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330700113] [2025-02-06 02:39:23,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:23,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:39:23,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:23,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:39:23,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:39:23,099 INFO L87 Difference]: Start difference. First operand 1124 states and 1753 transitions. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:39:24,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:24,033 INFO L93 Difference]: Finished difference Result 2974 states and 4604 transitions. [2025-02-06 02:39:24,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:39:24,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 506 [2025-02-06 02:39:24,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:24,041 INFO L225 Difference]: With dead ends: 2974 [2025-02-06 02:39:24,042 INFO L226 Difference]: Without dead ends: 1853 [2025-02-06 02:39:24,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:39:24,045 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 615 mSDsluCounter, 2319 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 2967 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:24,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 2967 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 02:39:24,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2025-02-06 02:39:24,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1453. [2025-02-06 02:39:24,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1339 states have (on average 1.5369678864824496) internal successors, (2058), 1340 states have internal predecessors, (2058), 109 states have call successors, (109), 4 states have call predecessors, (109), 4 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-06 02:39:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2276 transitions. [2025-02-06 02:39:24,093 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2276 transitions. Word has length 506 [2025-02-06 02:39:24,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:24,093 INFO L471 AbstractCegarLoop]: Abstraction has 1453 states and 2276 transitions. [2025-02-06 02:39:24,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:39:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2276 transitions. [2025-02-06 02:39:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-02-06 02:39:24,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:24,098 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:24,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:39:24,098 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:24,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:24,099 INFO L85 PathProgramCache]: Analyzing trace with hash -2074626696, now seen corresponding path program 1 times [2025-02-06 02:39:24,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:24,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347288897] [2025-02-06 02:39:24,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:24,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:24,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-02-06 02:39:24,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-02-06 02:39:24,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:24,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:24,906 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:39:24,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:24,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347288897] [2025-02-06 02:39:24,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347288897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:24,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:24,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:39:24,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090087336] [2025-02-06 02:39:24,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:24,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:39:24,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:24,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:39:24,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:39:24,911 INFO L87 Difference]: Start difference. First operand 1453 states and 2276 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:39:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:25,575 INFO L93 Difference]: Finished difference Result 4175 states and 6504 transitions. [2025-02-06 02:39:25,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:39:25,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 506 [2025-02-06 02:39:25,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:25,601 INFO L225 Difference]: With dead ends: 4175 [2025-02-06 02:39:25,601 INFO L226 Difference]: Without dead ends: 2725 [2025-02-06 02:39:25,605 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-02-06 02:39:25,609 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 1329 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:25,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 1545 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:39:25,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2025-02-06 02:39:25,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 1736. [2025-02-06 02:39:25,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1736 states, 1509 states have (on average 1.504307488402916) internal successors, (2270), 1511 states have internal predecessors, (2270), 218 states have call successors, (218), 8 states have call predecessors, (218), 8 states have return successors, (218), 216 states have call predecessors, (218), 218 states have call successors, (218) [2025-02-06 02:39:25,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2706 transitions. [2025-02-06 02:39:25,752 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2706 transitions. Word has length 506 [2025-02-06 02:39:25,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:25,756 INFO L471 AbstractCegarLoop]: Abstraction has 1736 states and 2706 transitions. [2025-02-06 02:39:25,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:39:25,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2706 transitions. [2025-02-06 02:39:25,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-02-06 02:39:25,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:25,764 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:25,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:39:25,764 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:25,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:25,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1652474685, now seen corresponding path program 1 times [2025-02-06 02:39:25,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:25,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048157976] [2025-02-06 02:39:25,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:25,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:25,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-02-06 02:39:25,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-02-06 02:39:25,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:25,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:26,445 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:39:26,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:26,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048157976] [2025-02-06 02:39:26,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048157976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:26,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:26,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:39:26,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198575198] [2025-02-06 02:39:26,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:26,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:39:26,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:26,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:39:26,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:39:26,449 INFO L87 Difference]: Start difference. First operand 1736 states and 2706 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:39:26,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:26,928 INFO L93 Difference]: Finished difference Result 4135 states and 6414 transitions. [2025-02-06 02:39:26,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:39:26,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 507 [2025-02-06 02:39:26,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:26,939 INFO L225 Difference]: With dead ends: 4135 [2025-02-06 02:39:26,939 INFO L226 Difference]: Without dead ends: 2402 [2025-02-06 02:39:26,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:39:26,943 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 1316 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1316 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:26,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1316 Valid, 1917 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:39:26,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2025-02-06 02:39:26,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 1743. [2025-02-06 02:39:26,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1516 states have (on average 1.5052770448548813) internal successors, (2282), 1518 states have internal predecessors, (2282), 218 states have call successors, (218), 8 states have call predecessors, (218), 8 states have return successors, (218), 216 states have call predecessors, (218), 218 states have call successors, (218) [2025-02-06 02:39:27,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2718 transitions. [2025-02-06 02:39:27,002 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2718 transitions. Word has length 507 [2025-02-06 02:39:27,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:27,002 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2718 transitions. [2025-02-06 02:39:27,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:39:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2718 transitions. [2025-02-06 02:39:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2025-02-06 02:39:27,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:27,005 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:27,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:39:27,006 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:27,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:27,007 INFO L85 PathProgramCache]: Analyzing trace with hash -945116197, now seen corresponding path program 1 times [2025-02-06 02:39:27,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:27,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284401513] [2025-02-06 02:39:27,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:27,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:27,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-02-06 02:39:27,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-02-06 02:39:27,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:27,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:27,609 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:39:27,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:27,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284401513] [2025-02-06 02:39:27,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284401513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:27,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:27,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:39:27,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904521108] [2025-02-06 02:39:27,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:27,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:39:27,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:27,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:39:27,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:39:27,611 INFO L87 Difference]: Start difference. First operand 1743 states and 2718 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:39:28,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:28,516 INFO L93 Difference]: Finished difference Result 6415 states and 9982 transitions. [2025-02-06 02:39:28,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:39:28,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 508 [2025-02-06 02:39:28,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:28,541 INFO L225 Difference]: With dead ends: 6415 [2025-02-06 02:39:28,541 INFO L226 Difference]: Without dead ends: 4675 [2025-02-06 02:39:28,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:39:28,548 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 702 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 2232 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:28,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 2232 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:39:28,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4675 states. [2025-02-06 02:39:28,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4675 to 3919. [2025-02-06 02:39:28,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3919 states, 3466 states have (on average 1.5095210617426429) internal successors, (5232), 3470 states have internal predecessors, (5232), 436 states have call successors, (436), 16 states have call predecessors, (436), 16 states have return successors, (436), 432 states have call predecessors, (436), 436 states have call successors, (436) [2025-02-06 02:39:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 6104 transitions. [2025-02-06 02:39:28,707 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 6104 transitions. Word has length 508 [2025-02-06 02:39:28,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:28,708 INFO L471 AbstractCegarLoop]: Abstraction has 3919 states and 6104 transitions. [2025-02-06 02:39:28,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:39:28,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 6104 transitions. [2025-02-06 02:39:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2025-02-06 02:39:28,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:28,714 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:28,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:39:28,714 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:28,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:28,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1255490557, now seen corresponding path program 1 times [2025-02-06 02:39:28,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:28,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648861991] [2025-02-06 02:39:28,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:28,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:28,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-02-06 02:39:29,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-02-06 02:39:29,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:29,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 30 proven. 180 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-02-06 02:39:29,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:29,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648861991] [2025-02-06 02:39:29,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648861991] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:39:29,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933927175] [2025-02-06 02:39:29,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:29,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:39:29,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:39:29,998 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-02-06 02:39:30,001 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-02-06 02:39:30,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-02-06 02:39:30,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-02-06 02:39:30,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:30,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:30,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 1257 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:39:30,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:39:30,777 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 4950 proven. 90 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:39:30,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:39:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 120 proven. 90 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-02-06 02:39:31,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933927175] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:39:31,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:39:31,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-06 02:39:31,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667063255] [2025-02-06 02:39:31,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:39:31,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:39:31,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:31,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:39:31,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:39:31,203 INFO L87 Difference]: Start difference. First operand 3919 states and 6104 transitions. Second operand has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 4 states have call successors, (161), 2 states have call predecessors, (161), 4 states have return successors, (163), 4 states have call predecessors, (163), 4 states have call successors, (163) [2025-02-06 02:39:31,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:31,792 INFO L93 Difference]: Finished difference Result 7907 states and 12265 transitions. [2025-02-06 02:39:31,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 02:39:31,793 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 4 states have call successors, (161), 2 states have call predecessors, (161), 4 states have return successors, (163), 4 states have call predecessors, (163), 4 states have call successors, (163) Word has length 508 [2025-02-06 02:39:31,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:31,809 INFO L225 Difference]: With dead ends: 7907 [2025-02-06 02:39:31,809 INFO L226 Difference]: Without dead ends: 3991 [2025-02-06 02:39:31,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1028 GetRequests, 1013 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-02-06 02:39:31,816 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 679 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:31,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1136 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:39:31,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3991 states. [2025-02-06 02:39:31,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3991 to 3967. [2025-02-06 02:39:31,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3967 states, 3502 states have (on average 1.4951456310679612) internal successors, (5236), 3506 states have internal predecessors, (5236), 436 states have call successors, (436), 28 states have call predecessors, (436), 28 states have return successors, (436), 432 states have call predecessors, (436), 436 states have call successors, (436) [2025-02-06 02:39:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3967 states to 3967 states and 6108 transitions. [2025-02-06 02:39:31,979 INFO L78 Accepts]: Start accepts. Automaton has 3967 states and 6108 transitions. Word has length 508 [2025-02-06 02:39:31,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:31,980 INFO L471 AbstractCegarLoop]: Abstraction has 3967 states and 6108 transitions. [2025-02-06 02:39:31,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 4 states have call successors, (161), 2 states have call predecessors, (161), 4 states have return successors, (163), 4 states have call predecessors, (163), 4 states have call successors, (163) [2025-02-06 02:39:31,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3967 states and 6108 transitions. [2025-02-06 02:39:31,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2025-02-06 02:39:31,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:31,984 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:31,994 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-02-06 02:39:32,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 02:39:32,185 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:32,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:32,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1856615510, now seen corresponding path program 1 times [2025-02-06 02:39:32,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:32,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398148453] [2025-02-06 02:39:32,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:32,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:32,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes. [2025-02-06 02:39:32,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements. [2025-02-06 02:39:32,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:32,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:33,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 60 proven. 150 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-02-06 02:39:33,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:33,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398148453] [2025-02-06 02:39:33,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398148453] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:39:33,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748051638] [2025-02-06 02:39:33,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:33,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:39:33,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:39:33,277 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-02-06 02:39:33,282 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-02-06 02:39:33,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes. [2025-02-06 02:39:33,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements. [2025-02-06 02:39:33,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:33,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:33,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 1257 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:39:33,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:39:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 3318 proven. 42 refuted. 0 times theorem prover too weak. 6580 trivial. 0 not checked. [2025-02-06 02:39:33,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:39:33,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 168 proven. 42 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-02-06 02:39:33,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748051638] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:39:33,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:39:33,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-06 02:39:33,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393136095] [2025-02-06 02:39:33,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:39:33,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:39:33,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:33,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:39:33,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:39:33,995 INFO L87 Difference]: Start difference. First operand 3967 states and 6108 transitions. Second operand has 8 states, 8 states have (on average 33.625) internal successors, (269), 8 states have internal predecessors, (269), 3 states have call successors, (135), 2 states have call predecessors, (135), 4 states have return successors, (137), 3 states have call predecessors, (137), 3 states have call successors, (137) [2025-02-06 02:39:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:34,806 INFO L93 Difference]: Finished difference Result 6231 states and 9584 transitions. [2025-02-06 02:39:34,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 02:39:34,810 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 33.625) internal successors, (269), 8 states have internal predecessors, (269), 3 states have call successors, (135), 2 states have call predecessors, (135), 4 states have return successors, (137), 3 states have call predecessors, (137), 3 states have call successors, (137) Word has length 510 [2025-02-06 02:39:34,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:34,821 INFO L225 Difference]: With dead ends: 6231 [2025-02-06 02:39:34,821 INFO L226 Difference]: Without dead ends: 2267 [2025-02-06 02:39:34,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1033 GetRequests, 1017 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-02-06 02:39:34,826 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 1056 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:34,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 1080 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:39:34,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2025-02-06 02:39:34,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 2245. [2025-02-06 02:39:34,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2245 states, 1929 states have (on average 1.4779678589942975) internal successors, (2851), 1931 states have internal predecessors, (2851), 289 states have call successors, (289), 26 states have call predecessors, (289), 26 states have return successors, (289), 287 states have call predecessors, (289), 289 states have call successors, (289) [2025-02-06 02:39:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 3429 transitions. [2025-02-06 02:39:34,912 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 3429 transitions. Word has length 510 [2025-02-06 02:39:34,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:34,912 INFO L471 AbstractCegarLoop]: Abstraction has 2245 states and 3429 transitions. [2025-02-06 02:39:34,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 33.625) internal successors, (269), 8 states have internal predecessors, (269), 3 states have call successors, (135), 2 states have call predecessors, (135), 4 states have return successors, (137), 3 states have call predecessors, (137), 3 states have call successors, (137) [2025-02-06 02:39:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 3429 transitions. [2025-02-06 02:39:34,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2025-02-06 02:39:34,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:34,916 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:34,927 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-02-06 02:39:35,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:39:35,117 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:35,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:35,118 INFO L85 PathProgramCache]: Analyzing trace with hash -163894304, now seen corresponding path program 1 times [2025-02-06 02:39:35,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:35,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289706593] [2025-02-06 02:39:35,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:35,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:35,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes. [2025-02-06 02:39:35,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements. [2025-02-06 02:39:35,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:35,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:35,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:39:35,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:35,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289706593] [2025-02-06 02:39:35,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289706593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:35,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:35,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:39:35,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388305355] [2025-02-06 02:39:35,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:35,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:39:35,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:35,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:39:35,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:39:35,378 INFO L87 Difference]: Start difference. First operand 2245 states and 3429 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:39:35,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:35,794 INFO L93 Difference]: Finished difference Result 7225 states and 11048 transitions. [2025-02-06 02:39:35,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:39:35,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 511 [2025-02-06 02:39:35,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:35,812 INFO L225 Difference]: With dead ends: 7225 [2025-02-06 02:39:35,813 INFO L226 Difference]: Without dead ends: 5133 [2025-02-06 02:39:35,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:39:35,818 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 837 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:35,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 1538 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:39:35,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2025-02-06 02:39:36,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 5097. [2025-02-06 02:39:36,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5097 states, 4543 states have (on average 1.4888839973585737) internal successors, (6764), 4547 states have internal predecessors, (6764), 507 states have call successors, (507), 46 states have call predecessors, (507), 46 states have return successors, (507), 503 states have call predecessors, (507), 507 states have call successors, (507) [2025-02-06 02:39:36,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5097 states to 5097 states and 7778 transitions. [2025-02-06 02:39:36,050 INFO L78 Accepts]: Start accepts. Automaton has 5097 states and 7778 transitions. Word has length 511 [2025-02-06 02:39:36,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:36,050 INFO L471 AbstractCegarLoop]: Abstraction has 5097 states and 7778 transitions. [2025-02-06 02:39:36,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:39:36,051 INFO L276 IsEmpty]: Start isEmpty. Operand 5097 states and 7778 transitions. [2025-02-06 02:39:36,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2025-02-06 02:39:36,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:36,054 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:36,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 02:39:36,054 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:36,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:36,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1605743410, now seen corresponding path program 1 times [2025-02-06 02:39:36,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:36,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374035353] [2025-02-06 02:39:36,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:36,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:36,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-02-06 02:39:36,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-02-06 02:39:36,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:36,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:36,759 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:39:36,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:36,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374035353] [2025-02-06 02:39:36,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374035353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:36,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:36,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:39:36,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72424019] [2025-02-06 02:39:36,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:36,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:39:36,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:36,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:39:36,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:39:36,761 INFO L87 Difference]: Start difference. First operand 5097 states and 7778 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:39:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:37,210 INFO L93 Difference]: Finished difference Result 10061 states and 15344 transitions. [2025-02-06 02:39:37,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:39:37,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 512 [2025-02-06 02:39:37,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:37,224 INFO L225 Difference]: With dead ends: 10061 [2025-02-06 02:39:37,224 INFO L226 Difference]: Without dead ends: 5117 [2025-02-06 02:39:37,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:39:37,232 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 625 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:37,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1173 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:39:37,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5117 states. [2025-02-06 02:39:37,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5117 to 5117. [2025-02-06 02:39:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5117 states, 4558 states have (on average 1.4635805177709522) internal successors, (6671), 4562 states have internal predecessors, (6671), 507 states have call successors, (507), 51 states have call predecessors, (507), 51 states have return successors, (507), 503 states have call predecessors, (507), 507 states have call successors, (507) [2025-02-06 02:39:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5117 states to 5117 states and 7685 transitions. [2025-02-06 02:39:37,445 INFO L78 Accepts]: Start accepts. Automaton has 5117 states and 7685 transitions. Word has length 512 [2025-02-06 02:39:37,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:37,445 INFO L471 AbstractCegarLoop]: Abstraction has 5117 states and 7685 transitions. [2025-02-06 02:39:37,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:39:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 5117 states and 7685 transitions. [2025-02-06 02:39:37,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2025-02-06 02:39:37,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:37,450 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:37,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 02:39:37,450 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:37,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:37,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1703060368, now seen corresponding path program 1 times [2025-02-06 02:39:37,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:37,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140048196] [2025-02-06 02:39:37,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:37,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:37,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 513 statements into 1 equivalence classes. [2025-02-06 02:39:38,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 513 of 513 statements. [2025-02-06 02:39:38,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:38,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:38,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 60 proven. 150 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-02-06 02:39:38,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:38,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140048196] [2025-02-06 02:39:38,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140048196] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:39:38,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610378570] [2025-02-06 02:39:38,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:38,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:39:38,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:39:38,672 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-02-06 02:39:38,673 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-02-06 02:39:38,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 513 statements into 1 equivalence classes. [2025-02-06 02:39:38,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 513 of 513 statements. [2025-02-06 02:39:38,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:38,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:38,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 1264 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:39:38,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:39:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 2178 proven. 24 refuted. 0 times theorem prover too weak. 7738 trivial. 0 not checked. [2025-02-06 02:39:39,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:39:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 186 proven. 24 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-02-06 02:39:39,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610378570] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:39:39,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:39:39,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-02-06 02:39:39,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056044317] [2025-02-06 02:39:39,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:39:39,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:39:39,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:39,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:39:39,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:39:39,354 INFO L87 Difference]: Start difference. First operand 5117 states and 7685 transitions. Second operand has 10 states, 10 states have (on average 29.0) internal successors, (290), 10 states have internal predecessors, (290), 4 states have call successors, (150), 2 states have call predecessors, (150), 4 states have return successors, (151), 4 states have call predecessors, (151), 4 states have call successors, (151) [2025-02-06 02:39:40,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:40,553 INFO L93 Difference]: Finished difference Result 11013 states and 16496 transitions. [2025-02-06 02:39:40,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 02:39:40,554 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 29.0) internal successors, (290), 10 states have internal predecessors, (290), 4 states have call successors, (150), 2 states have call predecessors, (150), 4 states have return successors, (151), 4 states have call predecessors, (151), 4 states have call successors, (151) Word has length 513 [2025-02-06 02:39:40,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:40,569 INFO L225 Difference]: With dead ends: 11013 [2025-02-06 02:39:40,570 INFO L226 Difference]: Without dead ends: 6053 [2025-02-06 02:39:40,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1049 GetRequests, 1023 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2025-02-06 02:39:40,577 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 2664 mSDsluCounter, 1901 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 504 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2725 SdHoareTripleChecker+Valid, 2305 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 504 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:40,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2725 Valid, 2305 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [504 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:39:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6053 states. [2025-02-06 02:39:40,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6053 to 5141. [2025-02-06 02:39:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5141 states, 4577 states have (on average 1.4542276600393271) internal successors, (6656), 4581 states have internal predecessors, (6656), 507 states have call successors, (507), 56 states have call predecessors, (507), 56 states have return successors, (507), 503 states have call predecessors, (507), 507 states have call successors, (507) [2025-02-06 02:39:40,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5141 states to 5141 states and 7670 transitions. [2025-02-06 02:39:40,747 INFO L78 Accepts]: Start accepts. Automaton has 5141 states and 7670 transitions. Word has length 513 [2025-02-06 02:39:40,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:40,748 INFO L471 AbstractCegarLoop]: Abstraction has 5141 states and 7670 transitions. [2025-02-06 02:39:40,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 29.0) internal successors, (290), 10 states have internal predecessors, (290), 4 states have call successors, (150), 2 states have call predecessors, (150), 4 states have return successors, (151), 4 states have call predecessors, (151), 4 states have call successors, (151) [2025-02-06 02:39:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand 5141 states and 7670 transitions. [2025-02-06 02:39:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-02-06 02:39:40,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:40,752 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:39:40,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 02:39:40,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:39:40,954 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:40,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:40,955 INFO L85 PathProgramCache]: Analyzing trace with hash -309010134, now seen corresponding path program 1 times [2025-02-06 02:39:40,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:40,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862395794] [2025-02-06 02:39:40,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:40,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:40,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-02-06 02:39:41,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-02-06 02:39:41,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:41,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:39:41,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:41,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862395794] [2025-02-06 02:39:41,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862395794] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:41,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:41,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:39:41,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468780493] [2025-02-06 02:39:41,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:41,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:39:41,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:41,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:39:41,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:39:41,983 INFO L87 Difference]: Start difference. First operand 5141 states and 7670 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:39:43,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:43,338 INFO L93 Difference]: Finished difference Result 23473 states and 34948 transitions. [2025-02-06 02:39:43,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:39:43,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 514 [2025-02-06 02:39:43,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:43,386 INFO L225 Difference]: With dead ends: 23473 [2025-02-06 02:39:43,386 INFO L226 Difference]: Without dead ends: 18493 [2025-02-06 02:39:43,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:39:43,402 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 1863 mSDsluCounter, 1846 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1863 SdHoareTripleChecker+Valid, 2343 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:43,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1863 Valid, 2343 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 02:39:43,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18493 states. [2025-02-06 02:39:43,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18493 to 10239. [2025-02-06 02:39:43,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10239 states, 9274 states have (on average 1.4537416433038604) internal successors, (13482), 9286 states have internal predecessors, (13482), 871 states have call successors, (871), 93 states have call predecessors, (871), 93 states have return successors, (871), 859 states have call predecessors, (871), 871 states have call successors, (871) [2025-02-06 02:39:43,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10239 states to 10239 states and 15224 transitions. [2025-02-06 02:39:43,764 INFO L78 Accepts]: Start accepts. Automaton has 10239 states and 15224 transitions. Word has length 514 [2025-02-06 02:39:43,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:43,764 INFO L471 AbstractCegarLoop]: Abstraction has 10239 states and 15224 transitions. [2025-02-06 02:39:43,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:39:43,765 INFO L276 IsEmpty]: Start isEmpty. Operand 10239 states and 15224 transitions. [2025-02-06 02:39:43,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-02-06 02:39:43,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:43,801 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:39:43,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 02:39:43,801 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:43,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:43,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1424846957, now seen corresponding path program 1 times [2025-02-06 02:39:43,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:43,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277792621] [2025-02-06 02:39:43,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:43,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:43,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-02-06 02:39:44,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-02-06 02:39:44,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:44,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:44,799 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 114 proven. 96 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-02-06 02:39:44,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:44,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277792621] [2025-02-06 02:39:44,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277792621] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:39:44,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329934761] [2025-02-06 02:39:44,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:44,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:39:44,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:39:44,802 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:39:44,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 02:39:44,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-02-06 02:39:45,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-02-06 02:39:45,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:45,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:45,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 1267 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:39:45,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:39:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 5010 proven. 96 refuted. 0 times theorem prover too weak. 4834 trivial. 0 not checked. [2025-02-06 02:39:45,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:39:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 114 proven. 96 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-02-06 02:39:45,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329934761] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:39:45,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:39:45,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-06 02:39:45,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654951656] [2025-02-06 02:39:45,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:39:45,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:39:45,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:45,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:39:45,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:39:45,592 INFO L87 Difference]: Start difference. First operand 10239 states and 15224 transitions. Second operand has 8 states, 8 states have (on average 27.25) internal successors, (218), 8 states have internal predecessors, (218), 3 states have call successors, (135), 2 states have call predecessors, (135), 4 states have return successors, (136), 3 states have call predecessors, (136), 3 states have call successors, (136) [2025-02-06 02:39:46,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:46,255 INFO L93 Difference]: Finished difference Result 20411 states and 30294 transitions. [2025-02-06 02:39:46,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:39:46,256 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 27.25) internal successors, (218), 8 states have internal predecessors, (218), 3 states have call successors, (135), 2 states have call predecessors, (135), 4 states have return successors, (136), 3 states have call predecessors, (136), 3 states have call successors, (136) Word has length 514 [2025-02-06 02:39:46,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:46,316 INFO L225 Difference]: With dead ends: 20411 [2025-02-06 02:39:46,319 INFO L226 Difference]: Without dead ends: 10349 [2025-02-06 02:39:46,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1034 GetRequests, 1025 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:39:46,350 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 733 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:46,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 1159 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:39:46,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10349 states. [2025-02-06 02:39:46,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10349 to 10275. [2025-02-06 02:39:46,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10275 states, 9301 states have (on average 1.4498441027846467) internal successors, (13485), 9313 states have internal predecessors, (13485), 871 states have call successors, (871), 102 states have call predecessors, (871), 102 states have return successors, (871), 859 states have call predecessors, (871), 871 states have call successors, (871) [2025-02-06 02:39:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10275 states to 10275 states and 15227 transitions. [2025-02-06 02:39:46,690 INFO L78 Accepts]: Start accepts. Automaton has 10275 states and 15227 transitions. Word has length 514 [2025-02-06 02:39:46,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:46,690 INFO L471 AbstractCegarLoop]: Abstraction has 10275 states and 15227 transitions. [2025-02-06 02:39:46,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.25) internal successors, (218), 8 states have internal predecessors, (218), 3 states have call successors, (135), 2 states have call predecessors, (135), 4 states have return successors, (136), 3 states have call predecessors, (136), 3 states have call successors, (136) [2025-02-06 02:39:46,691 INFO L276 IsEmpty]: Start isEmpty. Operand 10275 states and 15227 transitions. [2025-02-06 02:39:46,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2025-02-06 02:39:46,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:46,695 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:39:46,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 02:39:46,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:39:46,896 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:46,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:46,898 INFO L85 PathProgramCache]: Analyzing trace with hash -716930158, now seen corresponding path program 1 times [2025-02-06 02:39:46,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:46,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887957820] [2025-02-06 02:39:46,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:46,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:46,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 515 statements into 1 equivalence classes. [2025-02-06 02:39:47,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 515 of 515 statements. [2025-02-06 02:39:47,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:47,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:50,557 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 312 proven. 300 refuted. 0 times theorem prover too weak. 9328 trivial. 0 not checked. [2025-02-06 02:39:50,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:50,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887957820] [2025-02-06 02:39:50,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887957820] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:39:50,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017014562] [2025-02-06 02:39:50,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:50,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:39:50,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:39:50,560 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:39:50,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 02:39:50,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 515 statements into 1 equivalence classes. [2025-02-06 02:39:50,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 515 of 515 statements. [2025-02-06 02:39:50,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:50,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:50,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-06 02:39:51,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:39:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 7445 proven. 798 refuted. 0 times theorem prover too weak. 1697 trivial. 0 not checked. [2025-02-06 02:39:56,105 INFO L312 TraceCheckSpWp]: Computing backward predicates...