./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-44.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_amount250_file-44.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 2cb491f7f9545a6adbf1064efa3c5a7ac2d13ac5b757e6b82f3ae15070d0ceda --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:17:42,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:17:42,777 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:17:42,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:17:42,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:17:42,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:17:42,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:17:42,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:17:42,806 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:17:42,806 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:17:42,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:17:42,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:17:42,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:17:42,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:17:42,808 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:17:42,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:17:42,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:17:42,809 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:17:42,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:17:42,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:17:42,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:17:42,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:17:42,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:17:42,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:17:42,810 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:17:42,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:17:42,810 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:17:42,810 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:17:42,810 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:17:42,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:17:42,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:17:42,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:17:42,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:17:42,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:17:42,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:17:42,811 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:17:42,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:17:42,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:17:42,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:17:42,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:17:42,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:17:42,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:17:42,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:17:42,812 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 -> 2cb491f7f9545a6adbf1064efa3c5a7ac2d13ac5b757e6b82f3ae15070d0ceda [2025-02-06 02:17:43,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:17:43,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:17:43,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:17:43,140 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:17:43,140 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:17:43,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-44.i [2025-02-06 02:17:44,561 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39b2c55ca/9ede4978d9a344058c481af3a2f071b7/FLAG22edfe391 [2025-02-06 02:17:44,951 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:17:44,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-44.i [2025-02-06 02:17:44,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39b2c55ca/9ede4978d9a344058c481af3a2f071b7/FLAG22edfe391 [2025-02-06 02:17:44,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39b2c55ca/9ede4978d9a344058c481af3a2f071b7 [2025-02-06 02:17:44,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:17:44,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:17:44,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:17:44,996 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:17:45,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:17:45,002 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:17:44" (1/1) ... [2025-02-06 02:17:45,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@616ef447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:45, skipping insertion in model container [2025-02-06 02:17:45,004 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:17:44" (1/1) ... [2025-02-06 02:17:45,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:17:45,179 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-44.i[916,929] [2025-02-06 02:17:45,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:17:45,334 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:17:45,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-44.i[916,929] [2025-02-06 02:17:45,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:17:45,445 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:17:45,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:45 WrapperNode [2025-02-06 02:17:45,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:17:45,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:17:45,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:17:45,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:17:45,453 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:17:45" (1/1) ... [2025-02-06 02:17:45,473 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:17:45" (1/1) ... [2025-02-06 02:17:45,548 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 520 [2025-02-06 02:17:45,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:17:45,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:17:45,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:17:45,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:17:45,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:45" (1/1) ... [2025-02-06 02:17:45,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:45" (1/1) ... [2025-02-06 02:17:45,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:45" (1/1) ... [2025-02-06 02:17:45,607 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:17:45,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:45" (1/1) ... [2025-02-06 02:17:45,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:45" (1/1) ... [2025-02-06 02:17:45,637 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:45" (1/1) ... [2025-02-06 02:17:45,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:45" (1/1) ... [2025-02-06 02:17:45,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:45" (1/1) ... [2025-02-06 02:17:45,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:45" (1/1) ... [2025-02-06 02:17:45,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:17:45,662 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:17:45,662 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:17:45,662 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:17:45,663 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:45" (1/1) ... [2025-02-06 02:17:45,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:17:45,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:17:45,697 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:17:45,701 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:17:45,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:17:45,724 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:17:45,725 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:17:45,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:17:45,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:17:45,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:17:45,836 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:17:45,839 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:17:46,778 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L354: havoc property_#t~ite41#1;havoc property_#t~bitwise37#1;havoc property_#t~ite40#1;havoc property_#t~ite39#1;havoc property_#t~bitwise38#1;havoc property_#t~short42#1;havoc property_#t~ite49#1;havoc property_#t~ite44#1;havoc property_#t~bitwise43#1;havoc property_#t~bitwise45#1;havoc property_#t~ite48#1;havoc property_#t~ite47#1;havoc property_#t~bitwise46#1;havoc property_#t~short50#1;havoc property_#t~ite53#1;havoc property_#t~ite52#1;havoc property_#t~bitwise51#1;havoc property_#t~short54#1;havoc property_#t~bitwise55#1;havoc property_#t~short56#1; [2025-02-06 02:17:46,866 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-02-06 02:17:46,867 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:17:46,896 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:17:46,897 INFO L337 CfgBuilder]: Removed 4 assume(true) statements. [2025-02-06 02:17:46,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:17:46 BoogieIcfgContainer [2025-02-06 02:17:46,897 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:17:46,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:17:46,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:17:46,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:17:46,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:17:44" (1/3) ... [2025-02-06 02:17:46,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df1930a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:17:46, skipping insertion in model container [2025-02-06 02:17:46,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:45" (2/3) ... [2025-02-06 02:17:46,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df1930a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:17:46, skipping insertion in model container [2025-02-06 02:17:46,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:17:46" (3/3) ... [2025-02-06 02:17:46,907 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-44.i [2025-02-06 02:17:46,918 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:17:46,921 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-44.i that has 2 procedures, 214 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:17:46,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:17:46,997 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;@7b2152b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:17:46,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:17:47,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 214 states, 167 states have (on average 1.5149700598802396) internal successors, (253), 168 states have internal predecessors, (253), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 02:17:47,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-02-06 02:17:47,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:47,027 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:47,028 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:47,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:47,033 INFO L85 PathProgramCache]: Analyzing trace with hash -790356665, now seen corresponding path program 1 times [2025-02-06 02:17:47,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:47,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925624326] [2025-02-06 02:17:47,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:47,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:47,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-06 02:17:47,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-06 02:17:47,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:47,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-02-06 02:17:47,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:47,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925624326] [2025-02-06 02:17:47,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925624326] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:17:47,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549324095] [2025-02-06 02:17:47,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:47,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:17:47,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:17:47,601 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:17:47,604 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:17:47,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-06 02:17:47,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-06 02:17:47,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:47,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:47,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:17:47,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:17:47,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-02-06 02:17:47,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:17:47,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549324095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:47,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:17:47,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:17:47,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561604607] [2025-02-06 02:17:47,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:47,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:17:47,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:47,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:17:47,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:17:47,993 INFO L87 Difference]: Start difference. First operand has 214 states, 167 states have (on average 1.5149700598802396) internal successors, (253), 168 states have internal predecessors, (253), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-02-06 02:17:48,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:48,065 INFO L93 Difference]: Finished difference Result 418 states and 715 transitions. [2025-02-06 02:17:48,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:17:48,067 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) Word has length 299 [2025-02-06 02:17:48,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:48,076 INFO L225 Difference]: With dead ends: 418 [2025-02-06 02:17:48,076 INFO L226 Difference]: Without dead ends: 207 [2025-02-06 02:17:48,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 300 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:17:48,087 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:48,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 316 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:17:48,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-02-06 02:17:48,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-02-06 02:17:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 161 states have (on average 1.4968944099378882) internal successors, (241), 161 states have internal predecessors, (241), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 02:17:48,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 329 transitions. [2025-02-06 02:17:48,168 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 329 transitions. Word has length 299 [2025-02-06 02:17:48,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:48,169 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 329 transitions. [2025-02-06 02:17:48,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-02-06 02:17:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 329 transitions. [2025-02-06 02:17:48,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-02-06 02:17:48,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:48,195 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:48,205 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:17:48,399 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:17:48,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:48,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:48,400 INFO L85 PathProgramCache]: Analyzing trace with hash -486252695, now seen corresponding path program 1 times [2025-02-06 02:17:48,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:48,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471693067] [2025-02-06 02:17:48,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:48,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:48,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-06 02:17:48,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-06 02:17:48,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:48,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:48,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-02-06 02:17:48,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:48,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471693067] [2025-02-06 02:17:48,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471693067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:48,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:17:48,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:17:48,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633074959] [2025-02-06 02:17:48,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:48,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:17:48,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:48,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:17:48,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:17:48,823 INFO L87 Difference]: Start difference. First operand 207 states and 329 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:17:49,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:49,080 INFO L93 Difference]: Finished difference Result 522 states and 828 transitions. [2025-02-06 02:17:49,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:17:49,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 299 [2025-02-06 02:17:49,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:49,084 INFO L225 Difference]: With dead ends: 522 [2025-02-06 02:17:49,085 INFO L226 Difference]: Without dead ends: 318 [2025-02-06 02:17:49,086 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:17:49,086 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 183 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:49,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 716 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:17:49,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-02-06 02:17:49,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 315. [2025-02-06 02:17:49,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 264 states have (on average 1.518939393939394) internal successors, (401), 265 states have internal predecessors, (401), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 02:17:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 497 transitions. [2025-02-06 02:17:49,123 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 497 transitions. Word has length 299 [2025-02-06 02:17:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:49,125 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 497 transitions. [2025-02-06 02:17:49,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:17:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 497 transitions. [2025-02-06 02:17:49,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-02-06 02:17:49,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:49,131 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:49,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:17:49,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:49,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:49,133 INFO L85 PathProgramCache]: Analyzing trace with hash -156486934, now seen corresponding path program 1 times [2025-02-06 02:17:49,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:49,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271451940] [2025-02-06 02:17:49,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:49,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:49,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-06 02:17:49,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-06 02:17:49,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:49,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-02-06 02:17:49,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:49,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271451940] [2025-02-06 02:17:49,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271451940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:49,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:17:49,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:17:49,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859314408] [2025-02-06 02:17:49,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:49,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:17:49,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:49,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:17:49,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:17:49,694 INFO L87 Difference]: Start difference. First operand 315 states and 497 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:17:50,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:50,149 INFO L93 Difference]: Finished difference Result 930 states and 1473 transitions. [2025-02-06 02:17:50,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:17:50,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 299 [2025-02-06 02:17:50,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:50,158 INFO L225 Difference]: With dead ends: 930 [2025-02-06 02:17:50,159 INFO L226 Difference]: Without dead ends: 618 [2025-02-06 02:17:50,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:17:50,162 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 449 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:50,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 915 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:17:50,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-02-06 02:17:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 398. [2025-02-06 02:17:50,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 302 states have (on average 1.4701986754966887) internal successors, (444), 303 states have internal predecessors, (444), 92 states have call successors, (92), 3 states have call predecessors, (92), 3 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-06 02:17:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 628 transitions. [2025-02-06 02:17:50,236 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 628 transitions. Word has length 299 [2025-02-06 02:17:50,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:50,238 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 628 transitions. [2025-02-06 02:17:50,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:17:50,239 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 628 transitions. [2025-02-06 02:17:50,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-02-06 02:17:50,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:50,243 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:50,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:17:50,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:50,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:50,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1181180855, now seen corresponding path program 1 times [2025-02-06 02:17:50,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:50,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169453] [2025-02-06 02:17:50,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:50,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:50,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-06 02:17:50,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-06 02:17:50,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:50,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-02-06 02:17:50,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:50,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169453] [2025-02-06 02:17:50,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:50,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:17:50,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:17:50,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295003299] [2025-02-06 02:17:50,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:50,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:17:50,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:50,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:17:50,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:17:50,970 INFO L87 Difference]: Start difference. First operand 398 states and 628 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:17:51,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:51,256 INFO L93 Difference]: Finished difference Result 931 states and 1473 transitions. [2025-02-06 02:17:51,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:17:51,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 299 [2025-02-06 02:17:51,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:51,262 INFO L225 Difference]: With dead ends: 931 [2025-02-06 02:17:51,262 INFO L226 Difference]: Without dead ends: 618 [2025-02-06 02:17:51,263 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:17:51,264 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 354 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:51,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 929 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:17:51,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-02-06 02:17:51,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 398. [2025-02-06 02:17:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 302 states have (on average 1.466887417218543) internal successors, (443), 303 states have internal predecessors, (443), 92 states have call successors, (92), 3 states have call predecessors, (92), 3 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-06 02:17:51,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 627 transitions. [2025-02-06 02:17:51,316 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 627 transitions. Word has length 299 [2025-02-06 02:17:51,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:51,317 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 627 transitions. [2025-02-06 02:17:51,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:17:51,317 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 627 transitions. [2025-02-06 02:17:51,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-02-06 02:17:51,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:51,322 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:51,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:17:51,322 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:51,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1190183692, now seen corresponding path program 1 times [2025-02-06 02:17:51,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:51,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966381482] [2025-02-06 02:17:51,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:51,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-02-06 02:17:51,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-02-06 02:17:51,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:51,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-02-06 02:17:51,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:51,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966381482] [2025-02-06 02:17:51,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966381482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:51,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:17:51,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:17:51,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2407447] [2025-02-06 02:17:51,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:51,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:17:51,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:51,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:17:51,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:17:51,775 INFO L87 Difference]: Start difference. First operand 398 states and 627 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:17:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:51,953 INFO L93 Difference]: Finished difference Result 1023 states and 1616 transitions. [2025-02-06 02:17:51,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:17:51,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 300 [2025-02-06 02:17:51,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:51,962 INFO L225 Difference]: With dead ends: 1023 [2025-02-06 02:17:51,962 INFO L226 Difference]: Without dead ends: 711 [2025-02-06 02:17:51,964 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:17:51,965 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 227 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:51,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 716 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:17:51,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-02-06 02:17:52,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 708. [2025-02-06 02:17:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 562 states have (on average 1.4857651245551602) internal successors, (835), 564 states have internal predecessors, (835), 140 states have call successors, (140), 5 states have call predecessors, (140), 5 states have return successors, (140), 138 states have call predecessors, (140), 140 states have call successors, (140) [2025-02-06 02:17:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1115 transitions. [2025-02-06 02:17:52,066 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1115 transitions. Word has length 300 [2025-02-06 02:17:52,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:52,069 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 1115 transitions. [2025-02-06 02:17:52,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:17:52,069 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1115 transitions. [2025-02-06 02:17:52,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-02-06 02:17:52,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:52,074 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:52,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:17:52,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:52,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:52,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1005443948, now seen corresponding path program 1 times [2025-02-06 02:17:52,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:52,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979546004] [2025-02-06 02:17:52,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:52,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:52,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-02-06 02:17:52,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-02-06 02:17:52,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:52,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-02-06 02:17:52,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:52,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979546004] [2025-02-06 02:17:52,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979546004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:52,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:17:52,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:17:52,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822326615] [2025-02-06 02:17:52,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:52,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:17:52,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:52,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:17:52,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:17:52,707 INFO L87 Difference]: Start difference. First operand 708 states and 1115 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:17:53,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:53,050 INFO L93 Difference]: Finished difference Result 1543 states and 2411 transitions. [2025-02-06 02:17:53,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:17:53,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 301 [2025-02-06 02:17:53,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:53,058 INFO L225 Difference]: With dead ends: 1543 [2025-02-06 02:17:53,059 INFO L226 Difference]: Without dead ends: 922 [2025-02-06 02:17:53,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:17:53,061 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 368 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:53,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 963 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:17:53,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-02-06 02:17:53,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 700. [2025-02-06 02:17:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 561 states have (on average 1.5080213903743316) internal successors, (846), 561 states have internal predecessors, (846), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-02-06 02:17:53,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1110 transitions. [2025-02-06 02:17:53,135 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1110 transitions. Word has length 301 [2025-02-06 02:17:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:53,138 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 1110 transitions. [2025-02-06 02:17:53,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:17:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1110 transitions. [2025-02-06 02:17:53,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-02-06 02:17:53,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:53,143 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:53,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:17:53,144 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:53,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:53,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1004659893, now seen corresponding path program 1 times [2025-02-06 02:17:53,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:53,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161841863] [2025-02-06 02:17:53,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:53,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:53,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-02-06 02:17:53,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-02-06 02:17:53,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:53,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:53,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-02-06 02:17:53,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:53,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161841863] [2025-02-06 02:17:53,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161841863] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:53,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:17:53,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:17:53,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854438187] [2025-02-06 02:17:53,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:53,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:17:53,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:53,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:17:53,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:17:53,519 INFO L87 Difference]: Start difference. First operand 700 states and 1110 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:17:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:53,631 INFO L93 Difference]: Finished difference Result 1840 states and 2927 transitions. [2025-02-06 02:17:53,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:17:53,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 301 [2025-02-06 02:17:53,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:53,642 INFO L225 Difference]: With dead ends: 1840 [2025-02-06 02:17:53,642 INFO L226 Difference]: Without dead ends: 1231 [2025-02-06 02:17:53,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:17:53,646 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 218 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:53,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 769 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:17:53,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2025-02-06 02:17:53,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1229. [2025-02-06 02:17:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 998 states have (on average 1.5120240480961924) internal successors, (1509), 998 states have internal predecessors, (1509), 220 states have call successors, (220), 10 states have call predecessors, (220), 10 states have return successors, (220), 220 states have call predecessors, (220), 220 states have call successors, (220) [2025-02-06 02:17:53,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1949 transitions. [2025-02-06 02:17:53,791 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1949 transitions. Word has length 301 [2025-02-06 02:17:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:53,793 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 1949 transitions. [2025-02-06 02:17:53,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:17:53,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1949 transitions. [2025-02-06 02:17:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-06 02:17:53,800 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:53,800 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:53,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:17:53,800 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:53,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:53,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1918571069, now seen corresponding path program 1 times [2025-02-06 02:17:53,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:53,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958025734] [2025-02-06 02:17:53,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:53,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:53,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-06 02:17:54,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-06 02:17:54,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:54,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-02-06 02:17:57,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:57,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958025734] [2025-02-06 02:17:57,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958025734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:57,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:17:57,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 02:17:57,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815359171] [2025-02-06 02:17:57,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:57,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:17:57,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:57,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:17:57,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:17:57,535 INFO L87 Difference]: Start difference. First operand 1229 states and 1949 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:18:01,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:18:01,940 INFO L93 Difference]: Finished difference Result 6003 states and 9301 transitions. [2025-02-06 02:18:01,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 02:18:01,941 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 302 [2025-02-06 02:18:01,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:18:01,967 INFO L225 Difference]: With dead ends: 6003 [2025-02-06 02:18:01,967 INFO L226 Difference]: Without dead ends: 4865 [2025-02-06 02:18:01,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=107, Unknown=0, NotChecked=0, Total=182 [2025-02-06 02:18:01,973 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 1363 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 2052 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:18:01,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1363 Valid, 2052 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-06 02:18:01,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4865 states. [2025-02-06 02:18:02,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4865 to 3657. [2025-02-06 02:18:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3657 states, 3266 states have (on average 1.5416411512553583) internal successors, (5035), 3274 states have internal predecessors, (5035), 356 states have call successors, (356), 34 states have call predecessors, (356), 34 states have return successors, (356), 348 states have call predecessors, (356), 356 states have call successors, (356) [2025-02-06 02:18:02,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 5747 transitions. [2025-02-06 02:18:02,260 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 5747 transitions. Word has length 302 [2025-02-06 02:18:02,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:18:02,260 INFO L471 AbstractCegarLoop]: Abstraction has 3657 states and 5747 transitions. [2025-02-06 02:18:02,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:18:02,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 5747 transitions. [2025-02-06 02:18:02,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-06 02:18:02,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:18:02,270 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:02,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:18:02,270 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:18:02,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:18:02,271 INFO L85 PathProgramCache]: Analyzing trace with hash 338339938, now seen corresponding path program 1 times [2025-02-06 02:18:02,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:18:02,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346621197] [2025-02-06 02:18:02,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:18:02,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:18:02,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-06 02:18:02,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-06 02:18:02,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:18:02,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:18:02,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-02-06 02:18:02,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:18:02,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346621197] [2025-02-06 02:18:02,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346621197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:18:02,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:18:02,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:18:02,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851702099] [2025-02-06 02:18:02,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:18:02,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:18:02,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:18:02,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:18:02,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:18:02,801 INFO L87 Difference]: Start difference. First operand 3657 states and 5747 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:18:03,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:18:03,228 INFO L93 Difference]: Finished difference Result 7875 states and 12394 transitions. [2025-02-06 02:18:03,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:18:03,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 302 [2025-02-06 02:18:03,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:18:03,255 INFO L225 Difference]: With dead ends: 7875 [2025-02-06 02:18:03,255 INFO L226 Difference]: Without dead ends: 4309 [2025-02-06 02:18:03,264 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:18:03,265 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 366 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:18:03,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 927 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:18:03,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2025-02-06 02:18:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 3651. [2025-02-06 02:18:03,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3651 states, 3260 states have (on average 1.541717791411043) internal successors, (5026), 3268 states have internal predecessors, (5026), 356 states have call successors, (356), 34 states have call predecessors, (356), 34 states have return successors, (356), 348 states have call predecessors, (356), 356 states have call successors, (356) [2025-02-06 02:18:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 5738 transitions. [2025-02-06 02:18:03,545 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 5738 transitions. Word has length 302 [2025-02-06 02:18:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:18:03,545 INFO L471 AbstractCegarLoop]: Abstraction has 3651 states and 5738 transitions. [2025-02-06 02:18:03,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:18:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 5738 transitions. [2025-02-06 02:18:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-06 02:18:03,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:18:03,550 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:03,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:18:03,551 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:18:03,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:18:03,551 INFO L85 PathProgramCache]: Analyzing trace with hash 2135856098, now seen corresponding path program 1 times [2025-02-06 02:18:03,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:18:03,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633020505] [2025-02-06 02:18:03,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:18:03,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:18:03,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-06 02:18:03,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-06 02:18:03,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:18:03,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:18:06,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-02-06 02:18:06,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:18:06,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633020505] [2025-02-06 02:18:06,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633020505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:18:06,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:18:06,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 02:18:06,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115315006] [2025-02-06 02:18:06,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:18:06,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:18:06,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:18:06,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:18:06,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:18:06,517 INFO L87 Difference]: Start difference. First operand 3651 states and 5738 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:18:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:18:10,988 INFO L93 Difference]: Finished difference Result 9765 states and 15285 transitions. [2025-02-06 02:18:10,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 02:18:10,989 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 302 [2025-02-06 02:18:10,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:18:11,025 INFO L225 Difference]: With dead ends: 9765 [2025-02-06 02:18:11,025 INFO L226 Difference]: Without dead ends: 6205 [2025-02-06 02:18:11,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-02-06 02:18:11,036 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 1614 mSDsluCounter, 1653 mSDsCounter, 0 mSdLazyCounter, 2102 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1614 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 2314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 2102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:18:11,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1614 Valid, 2099 Invalid, 2314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 2102 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-02-06 02:18:11,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6205 states. [2025-02-06 02:18:11,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6205 to 5741. [2025-02-06 02:18:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5741 states, 5098 states have (on average 1.5378579835229502) internal successors, (7840), 5110 states have internal predecessors, (7840), 584 states have call successors, (584), 58 states have call predecessors, (584), 58 states have return successors, (584), 572 states have call predecessors, (584), 584 states have call successors, (584) [2025-02-06 02:18:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5741 states to 5741 states and 9008 transitions. [2025-02-06 02:18:11,419 INFO L78 Accepts]: Start accepts. Automaton has 5741 states and 9008 transitions. Word has length 302 [2025-02-06 02:18:11,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:18:11,420 INFO L471 AbstractCegarLoop]: Abstraction has 5741 states and 9008 transitions. [2025-02-06 02:18:11,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:18:11,421 INFO L276 IsEmpty]: Start isEmpty. Operand 5741 states and 9008 transitions. [2025-02-06 02:18:11,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-06 02:18:11,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:18:11,425 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:11,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:18:11,426 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:18:11,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:18:11,427 INFO L85 PathProgramCache]: Analyzing trace with hash 97799809, now seen corresponding path program 1 times [2025-02-06 02:18:11,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:18:11,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763459947] [2025-02-06 02:18:11,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:18:11,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:18:11,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-06 02:18:11,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-06 02:18:11,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:18:11,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:18:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 12 proven. 117 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2025-02-06 02:18:12,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:18:12,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763459947] [2025-02-06 02:18:12,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763459947] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:18:12,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007774720] [2025-02-06 02:18:12,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:18:12,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:18:12,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:18:12,141 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:18:12,143 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:18:12,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-06 02:18:12,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-06 02:18:12,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:18:12,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:18:12,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:18:12,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:18:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 675 proven. 117 refuted. 0 times theorem prover too weak. 2992 trivial. 0 not checked. [2025-02-06 02:18:12,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:18:13,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 12 proven. 117 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2025-02-06 02:18:13,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007774720] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:18:13,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:18:13,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-06 02:18:13,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007047086] [2025-02-06 02:18:13,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:18:13,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:18:13,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:18:13,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:18:13,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:18:13,329 INFO L87 Difference]: Start difference. First operand 5741 states and 9008 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 2 states have call successors, (83), 2 states have call predecessors, (83), 4 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) [2025-02-06 02:18:13,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:18:13,852 INFO L93 Difference]: Finished difference Result 9905 states and 15302 transitions. [2025-02-06 02:18:13,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:18:13,853 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 2 states have call successors, (83), 2 states have call predecessors, (83), 4 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) Word has length 302 [2025-02-06 02:18:13,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:18:13,884 INFO L225 Difference]: With dead ends: 9905 [2025-02-06 02:18:13,884 INFO L226 Difference]: Without dead ends: 4255 [2025-02-06 02:18:13,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 601 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:18:13,903 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 392 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:18:13,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 691 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:18:13,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2025-02-06 02:18:14,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 4171. [2025-02-06 02:18:14,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4171 states, 3507 states have (on average 1.470772740233818) internal successors, (5158), 3519 states have internal predecessors, (5158), 584 states have call successors, (584), 79 states have call predecessors, (584), 79 states have return successors, (584), 572 states have call predecessors, (584), 584 states have call successors, (584) [2025-02-06 02:18:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 6326 transitions. [2025-02-06 02:18:14,268 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 6326 transitions. Word has length 302 [2025-02-06 02:18:14,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:18:14,269 INFO L471 AbstractCegarLoop]: Abstraction has 4171 states and 6326 transitions. [2025-02-06 02:18:14,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 2 states have call successors, (83), 2 states have call predecessors, (83), 4 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) [2025-02-06 02:18:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 6326 transitions. [2025-02-06 02:18:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-06 02:18:14,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:18:14,273 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:14,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 02:18:14,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:18:14,474 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:18:14,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:18:14,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1677228939, now seen corresponding path program 1 times [2025-02-06 02:18:14,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:18:14,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618866481] [2025-02-06 02:18:14,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:18:14,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:18:14,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-06 02:18:14,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-06 02:18:14,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:18:14,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:18:15,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 87 proven. 42 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2025-02-06 02:18:15,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:18:15,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618866481] [2025-02-06 02:18:15,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618866481] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:18:15,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264373595] [2025-02-06 02:18:15,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:18:15,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:18:15,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:18:15,398 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:18:15,401 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:18:15,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-06 02:18:15,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-06 02:18:15,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:18:15,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:18:15,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 02:18:15,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:18:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-02-06 02:18:15,904 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:18:15,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264373595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:18:15,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:18:15,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 12 [2025-02-06 02:18:15,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918879120] [2025-02-06 02:18:15,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:18:15,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:18:15,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:18:15,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:18:15,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:18:15,906 INFO L87 Difference]: Start difference. First operand 4171 states and 6326 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 2 states have call successors, (44), 2 states have call predecessors, (44), 3 states have return successors, (44), 3 states have call predecessors, (44), 2 states have call successors, (44) [2025-02-06 02:18:17,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:18:17,412 INFO L93 Difference]: Finished difference Result 8484 states and 12753 transitions. [2025-02-06 02:18:17,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 02:18:17,413 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 2 states have call successors, (44), 2 states have call predecessors, (44), 3 states have return successors, (44), 3 states have call predecessors, (44), 2 states have call successors, (44) Word has length 303 [2025-02-06 02:18:17,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:18:17,442 INFO L225 Difference]: With dead ends: 8484 [2025-02-06 02:18:17,442 INFO L226 Difference]: Without dead ends: 6442 [2025-02-06 02:18:17,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2025-02-06 02:18:17,449 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 486 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:18:17,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 2002 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 02:18:17,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6442 states. [2025-02-06 02:18:17,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6442 to 4243. [2025-02-06 02:18:17,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4243 states, 3561 states have (on average 1.4636338107273237) internal successors, (5212), 3573 states have internal predecessors, (5212), 584 states have call successors, (584), 97 states have call predecessors, (584), 97 states have return successors, (584), 572 states have call predecessors, (584), 584 states have call successors, (584) [2025-02-06 02:18:17,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4243 states to 4243 states and 6380 transitions. [2025-02-06 02:18:17,820 INFO L78 Accepts]: Start accepts. Automaton has 4243 states and 6380 transitions. Word has length 303 [2025-02-06 02:18:17,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:18:17,821 INFO L471 AbstractCegarLoop]: Abstraction has 4243 states and 6380 transitions. [2025-02-06 02:18:17,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 2 states have call successors, (44), 2 states have call predecessors, (44), 3 states have return successors, (44), 3 states have call predecessors, (44), 2 states have call successors, (44) [2025-02-06 02:18:17,822 INFO L276 IsEmpty]: Start isEmpty. Operand 4243 states and 6380 transitions. [2025-02-06 02:18:17,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-06 02:18:17,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:18:17,825 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:17,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 02:18:18,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:18:18,030 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:18:18,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:18:18,031 INFO L85 PathProgramCache]: Analyzing trace with hash -646798900, now seen corresponding path program 1 times [2025-02-06 02:18:18,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:18:18,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908255528] [2025-02-06 02:18:18,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:18:18,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:18:18,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-06 02:18:18,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-06 02:18:18,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:18:18,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:18:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-02-06 02:18:18,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:18:18,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908255528] [2025-02-06 02:18:18,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908255528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:18:18,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:18:18,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:18:18,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51756978] [2025-02-06 02:18:18,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:18:18,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:18:18,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:18:18,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:18:18,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:18:18,831 INFO L87 Difference]: Start difference. First operand 4243 states and 6380 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:18:20,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:18:20,741 INFO L93 Difference]: Finished difference Result 13785 states and 20737 transitions. [2025-02-06 02:18:20,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:18:20,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 303 [2025-02-06 02:18:20,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:18:20,789 INFO L225 Difference]: With dead ends: 13785 [2025-02-06 02:18:20,789 INFO L226 Difference]: Without dead ends: 9645 [2025-02-06 02:18:20,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:18:20,802 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 1172 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:18:20,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 1578 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 02:18:20,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9645 states. [2025-02-06 02:18:21,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9645 to 7049. [2025-02-06 02:18:21,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7049 states, 6119 states have (on average 1.4897859127308384) internal successors, (9116), 6141 states have internal predecessors, (9116), 794 states have call successors, (794), 135 states have call predecessors, (794), 135 states have return successors, (794), 772 states have call predecessors, (794), 794 states have call successors, (794) [2025-02-06 02:18:21,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7049 states to 7049 states and 10704 transitions. [2025-02-06 02:18:21,390 INFO L78 Accepts]: Start accepts. Automaton has 7049 states and 10704 transitions. Word has length 303 [2025-02-06 02:18:21,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:18:21,392 INFO L471 AbstractCegarLoop]: Abstraction has 7049 states and 10704 transitions. [2025-02-06 02:18:21,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:18:21,393 INFO L276 IsEmpty]: Start isEmpty. Operand 7049 states and 10704 transitions. [2025-02-06 02:18:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-06 02:18:21,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:18:21,398 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:21,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:18:21,398 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:18:21,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:18:21,399 INFO L85 PathProgramCache]: Analyzing trace with hash 642727219, now seen corresponding path program 1 times [2025-02-06 02:18:21,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:18:21,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206087256] [2025-02-06 02:18:21,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:18:21,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:18:21,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-06 02:18:21,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-06 02:18:21,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:18:21,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:18:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-02-06 02:18:21,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:18:21,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206087256] [2025-02-06 02:18:21,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206087256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:18:21,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:18:21,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:18:21,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740106640] [2025-02-06 02:18:21,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:18:21,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:18:21,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:18:21,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:18:21,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:18:21,678 INFO L87 Difference]: Start difference. First operand 7049 states and 10704 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:18:25,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 02:18:29,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 02:18:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:18:31,197 INFO L93 Difference]: Finished difference Result 24027 states and 36284 transitions. [2025-02-06 02:18:31,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:18:31,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 303 [2025-02-06 02:18:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:18:31,264 INFO L225 Difference]: With dead ends: 24027 [2025-02-06 02:18:31,264 INFO L226 Difference]: Without dead ends: 17081 [2025-02-06 02:18:31,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:18:31,280 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 743 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 95 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:18:31,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 896 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 192 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-02-06 02:18:31,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17081 states. [2025-02-06 02:18:32,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17081 to 10807. [2025-02-06 02:18:32,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10807 states, 9877 states have (on average 1.5380176166852284) internal successors, (15191), 9899 states have internal predecessors, (15191), 794 states have call successors, (794), 135 states have call predecessors, (794), 135 states have return successors, (794), 772 states have call predecessors, (794), 794 states have call successors, (794) [2025-02-06 02:18:32,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10807 states to 10807 states and 16779 transitions. [2025-02-06 02:18:32,130 INFO L78 Accepts]: Start accepts. Automaton has 10807 states and 16779 transitions. Word has length 303 [2025-02-06 02:18:32,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:18:32,132 INFO L471 AbstractCegarLoop]: Abstraction has 10807 states and 16779 transitions. [2025-02-06 02:18:32,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:18:32,133 INFO L276 IsEmpty]: Start isEmpty. Operand 10807 states and 16779 transitions. [2025-02-06 02:18:32,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-06 02:18:32,196 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:18:32,197 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:32,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:18:32,198 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:18:32,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:18:32,199 INFO L85 PathProgramCache]: Analyzing trace with hash -569929439, now seen corresponding path program 1 times [2025-02-06 02:18:32,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:18:32,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032685512] [2025-02-06 02:18:32,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:18:32,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:18:32,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-06 02:18:32,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-06 02:18:32,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:18:32,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:18:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-02-06 02:18:32,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:18:32,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032685512] [2025-02-06 02:18:32,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032685512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:18:32,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:18:32,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:18:32,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6590825] [2025-02-06 02:18:32,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:18:32,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:18:32,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:18:32,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:18:32,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:18:32,539 INFO L87 Difference]: Start difference. First operand 10807 states and 16779 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:18:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:18:33,390 INFO L93 Difference]: Finished difference Result 31522 states and 49198 transitions. [2025-02-06 02:18:33,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:18:33,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 303 [2025-02-06 02:18:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:18:33,455 INFO L225 Difference]: With dead ends: 31522 [2025-02-06 02:18:33,455 INFO L226 Difference]: Without dead ends: 20818 [2025-02-06 02:18:33,477 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:18:33,479 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 477 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:18:33,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1015 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:18:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20818 states. [2025-02-06 02:18:34,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20818 to 13365. [2025-02-06 02:18:34,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13365 states, 12435 states have (on average 1.5565741857659832) internal successors, (19356), 12457 states have internal predecessors, (19356), 794 states have call successors, (794), 135 states have call predecessors, (794), 135 states have return successors, (794), 772 states have call predecessors, (794), 794 states have call successors, (794) [2025-02-06 02:18:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13365 states to 13365 states and 20944 transitions. [2025-02-06 02:18:34,474 INFO L78 Accepts]: Start accepts. Automaton has 13365 states and 20944 transitions. Word has length 303 [2025-02-06 02:18:34,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:18:34,474 INFO L471 AbstractCegarLoop]: Abstraction has 13365 states and 20944 transitions. [2025-02-06 02:18:34,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-06 02:18:34,475 INFO L276 IsEmpty]: Start isEmpty. Operand 13365 states and 20944 transitions. [2025-02-06 02:18:34,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-02-06 02:18:34,480 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:18:34,480 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:34,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 02:18:34,480 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:18:34,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:18:34,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1632409951, now seen corresponding path program 1 times [2025-02-06 02:18:34,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:18:34,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445552119] [2025-02-06 02:18:34,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:18:34,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:18:34,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-02-06 02:18:34,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-02-06 02:18:34,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:18:34,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:18:37,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 36 proven. 93 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2025-02-06 02:18:37,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:18:37,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445552119] [2025-02-06 02:18:37,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445552119] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:18:37,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936313249] [2025-02-06 02:18:37,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:18:37,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:18:37,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:18:37,478 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:18:37,526 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:18:37,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-02-06 02:18:37,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-02-06 02:18:37,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:18:37,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:18:37,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 02:18:37,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:18:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1741 proven. 78 refuted. 0 times theorem prover too weak. 1965 trivial. 0 not checked. [2025-02-06 02:18:38,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:18:38,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 87 proven. 42 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2025-02-06 02:18:38,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936313249] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:18:38,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:18:38,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 7] total 26 [2025-02-06 02:18:38,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003298653] [2025-02-06 02:18:38,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:18:38,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 02:18:38,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:18:38,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 02:18:38,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2025-02-06 02:18:38,815 INFO L87 Difference]: Start difference. First operand 13365 states and 20944 transitions. Second operand has 26 states, 26 states have (on average 7.6923076923076925) internal successors, (200), 25 states have internal predecessors, (200), 8 states have call successors, (102), 3 states have call predecessors, (102), 5 states have return successors, (103), 8 states have call predecessors, (103), 8 states have call successors, (103) [2025-02-06 02:18:47,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 02:18:51,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []