./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-24.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 107d0e452e5595f1deab9eb0bc24a94452bda82a0a15c0d1f255f44e041f3176 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:38:27,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:38:27,945 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:38:27,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:38:27,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:38:27,979 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:38:27,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:38:27,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:38:27,981 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:38:27,982 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:38:27,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:38:27,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:38:27,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:38:27,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:38:27,983 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:38:27,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:38:27,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:38:27,983 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:38:27,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:38:27,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:38:27,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:38:27,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:38:27,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:38:27,984 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:38:27,984 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:38:27,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:38:27,984 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:38:27,984 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:38:27,984 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:38:27,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:38:27,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:38:27,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:38:27,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:38:27,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:38:27,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:38:27,985 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:38:27,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:38:27,986 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:38:27,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:38:27,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:38:27,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:38:27,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:38:27,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:38:27,986 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 -> 107d0e452e5595f1deab9eb0bc24a94452bda82a0a15c0d1f255f44e041f3176 [2025-02-06 02:38:28,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:38:28,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:38:28,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:38:28,209 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:38:28,209 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:38:28,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-24.i [2025-02-06 02:38:29,404 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8edcf30ba/c4142645db2d4ce7bc893284834472a2/FLAGa24854e46 [2025-02-06 02:38:29,682 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:38:29,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-24.i [2025-02-06 02:38:29,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8edcf30ba/c4142645db2d4ce7bc893284834472a2/FLAGa24854e46 [2025-02-06 02:38:29,987 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8edcf30ba/c4142645db2d4ce7bc893284834472a2 [2025-02-06 02:38:29,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:38:29,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:38:29,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:38:29,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:38:29,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:38:29,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:38:29" (1/1) ... [2025-02-06 02:38:29,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7591118a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:29, skipping insertion in model container [2025-02-06 02:38:29,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:38:29" (1/1) ... [2025-02-06 02:38:30,035 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:38:30,193 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-24.i[916,929] [2025-02-06 02:38:30,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:38:30,411 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:38:30,419 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-24.i[916,929] [2025-02-06 02:38:30,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:38:30,523 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:38:30,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:30 WrapperNode [2025-02-06 02:38:30,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:38:30,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:38:30,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:38:30,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:38:30,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:30" (1/1) ... [2025-02-06 02:38:30,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:30" (1/1) ... [2025-02-06 02:38:30,644 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 899 [2025-02-06 02:38:30,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:38:30,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:38:30,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:38:30,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:38:30,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:30" (1/1) ... [2025-02-06 02:38:30,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:30" (1/1) ... [2025-02-06 02:38:30,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:30" (1/1) ... [2025-02-06 02:38:30,749 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:38:30,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:30" (1/1) ... [2025-02-06 02:38:30,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:30" (1/1) ... [2025-02-06 02:38:30,784 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:30" (1/1) ... [2025-02-06 02:38:30,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:30" (1/1) ... [2025-02-06 02:38:30,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:30" (1/1) ... [2025-02-06 02:38:30,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:30" (1/1) ... [2025-02-06 02:38:30,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:38:30,820 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:38:30,820 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:38:30,820 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:38:30,821 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:30" (1/1) ... [2025-02-06 02:38:30,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:38:30,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:38:30,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:38:30,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:38:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:38:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:38:30,872 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:38:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:38:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:38:30,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:38:30,996 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:38:30,998 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:38:31,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L674: havoc property_#t~ite61#1;havoc property_#t~bitwise60#1;havoc property_#t~short62#1;havoc property_#t~ite66#1;havoc property_#t~bitwise63#1;havoc property_#t~ite65#1;havoc property_#t~bitwise64#1;havoc property_#t~short67#1;havoc property_#t~bitwise68#1;havoc property_#t~short69#1;havoc property_#t~ite71#1;havoc property_#t~bitwise70#1;havoc property_#t~short72#1;havoc property_#t~bitwise73#1;havoc property_#t~short74#1;havoc property_#t~ite76#1;havoc property_#t~bitwise75#1;havoc property_#t~short77#1;havoc property_#t~ite79#1;havoc property_#t~bitwise78#1;havoc property_#t~short80#1;havoc property_#t~ite87#1;havoc property_#t~ite86#1;havoc property_#t~ite85#1;havoc property_#t~ite84#1;havoc property_#t~bitwise81#1;havoc property_#t~ite83#1;havoc property_#t~bitwise82#1;havoc property_#t~short88#1; [2025-02-06 02:38:32,114 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2025-02-06 02:38:32,114 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:38:32,147 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:38:32,147 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:38:32,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:38:32 BoogieIcfgContainer [2025-02-06 02:38:32,147 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:38:32,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:38:32,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:38:32,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:38:32,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:38:29" (1/3) ... [2025-02-06 02:38:32,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152d1042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:38:32, skipping insertion in model container [2025-02-06 02:38:32,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:30" (2/3) ... [2025-02-06 02:38:32,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152d1042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:38:32, skipping insertion in model container [2025-02-06 02:38:32,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:38:32" (3/3) ... [2025-02-06 02:38:32,154 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-24.i [2025-02-06 02:38:32,163 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:38:32,166 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-24.i that has 2 procedures, 365 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:38:32,210 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:38:32,217 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;@2e9519b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:38:32,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:38:32,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 365 states, 282 states have (on average 1.5390070921985815) internal successors, (434), 283 states have internal predecessors, (434), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-06 02:38:32,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-02-06 02:38:32,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:32,241 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:32,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:32,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:32,247 INFO L85 PathProgramCache]: Analyzing trace with hash -399257857, now seen corresponding path program 1 times [2025-02-06 02:38:32,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:32,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370931217] [2025-02-06 02:38:32,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:32,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:32,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-06 02:38:32,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-06 02:38:32,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:32,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:32,824 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-02-06 02:38:32,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:32,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370931217] [2025-02-06 02:38:32,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370931217] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:38:32,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995077733] [2025-02-06 02:38:32,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:32,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:38:32,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:38:32,831 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:38:32,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:38:33,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-06 02:38:33,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-06 02:38:33,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:33,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:33,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 1313 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:38:33,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:38:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-02-06 02:38:33,293 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:38:33,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995077733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:33,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:38:33,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:38:33,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146048586] [2025-02-06 02:38:33,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:33,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:38:33,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:33,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:38:33,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:38:33,324 INFO L87 Difference]: Start difference. First operand has 365 states, 282 states have (on average 1.5390070921985815) internal successors, (434), 283 states have internal predecessors, (434), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) Second operand has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-02-06 02:38:33,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:33,433 INFO L93 Difference]: Finished difference Result 724 states and 1263 transitions. [2025-02-06 02:38:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:38:33,435 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) Word has length 545 [2025-02-06 02:38:33,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:33,443 INFO L225 Difference]: With dead ends: 724 [2025-02-06 02:38:33,443 INFO L226 Difference]: Without dead ends: 362 [2025-02-06 02:38:33,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:38:33,451 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:33,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 569 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:38:33,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-02-06 02:38:33,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2025-02-06 02:38:33,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 280 states have (on average 1.5321428571428573) internal successors, (429), 280 states have internal predecessors, (429), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-06 02:38:33,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 589 transitions. [2025-02-06 02:38:33,522 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 589 transitions. Word has length 545 [2025-02-06 02:38:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:33,524 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 589 transitions. [2025-02-06 02:38:33,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-02-06 02:38:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 589 transitions. [2025-02-06 02:38:33,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-02-06 02:38:33,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:33,536 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:33,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:38:33,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:38:33,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:33,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:33,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1952991365, now seen corresponding path program 1 times [2025-02-06 02:38:33,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:33,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943309336] [2025-02-06 02:38:33,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:33,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:33,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-06 02:38:34,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-06 02:38:34,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:34,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:36,116 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-06 02:38:36,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:36,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943309336] [2025-02-06 02:38:36,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943309336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:36,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:36,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:38:36,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749905018] [2025-02-06 02:38:36,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:36,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:38:36,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:36,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:38:36,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:38:36,122 INFO L87 Difference]: Start difference. First operand 362 states and 589 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-06 02:38:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:36,729 INFO L93 Difference]: Finished difference Result 1654 states and 2690 transitions. [2025-02-06 02:38:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:38:36,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 545 [2025-02-06 02:38:36,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:36,742 INFO L225 Difference]: With dead ends: 1654 [2025-02-06 02:38:36,744 INFO L226 Difference]: Without dead ends: 1295 [2025-02-06 02:38:36,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:38:36,746 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 1756 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:36,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1756 Valid, 2876 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:38:36,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2025-02-06 02:38:36,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 816. [2025-02-06 02:38:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 687 states have (on average 1.5764192139737991) internal successors, (1083), 688 states have internal predecessors, (1083), 126 states have call successors, (126), 2 states have call predecessors, (126), 2 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2025-02-06 02:38:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1335 transitions. [2025-02-06 02:38:36,847 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1335 transitions. Word has length 545 [2025-02-06 02:38:36,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:36,850 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1335 transitions. [2025-02-06 02:38:36,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-06 02:38:36,851 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1335 transitions. [2025-02-06 02:38:36,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-02-06 02:38:36,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:36,859 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:36,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:38:36,859 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:36,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:36,860 INFO L85 PathProgramCache]: Analyzing trace with hash 785224123, now seen corresponding path program 1 times [2025-02-06 02:38:36,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:36,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638916493] [2025-02-06 02:38:36,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:36,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:36,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-06 02:38:37,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-06 02:38:37,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:37,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:44,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-06 02:38:44,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:44,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638916493] [2025-02-06 02:38:44,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638916493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:44,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:44,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-06 02:38:44,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972130893] [2025-02-06 02:38:44,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:44,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 02:38:44,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:44,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 02:38:44,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-02-06 02:38:44,619 INFO L87 Difference]: Start difference. First operand 816 states and 1335 transitions. Second operand has 19 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 19 states have internal predecessors, (148), 5 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) [2025-02-06 02:38:58,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:58,282 INFO L93 Difference]: Finished difference Result 4412 states and 7090 transitions. [2025-02-06 02:38:58,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 02:38:58,283 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 19 states have internal predecessors, (148), 5 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) Word has length 545 [2025-02-06 02:38:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:58,299 INFO L225 Difference]: With dead ends: 4412 [2025-02-06 02:38:58,300 INFO L226 Difference]: Without dead ends: 3599 [2025-02-06 02:38:58,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=221, Invalid=709, Unknown=0, NotChecked=0, Total=930 [2025-02-06 02:38:58,303 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 8026 mSDsluCounter, 5916 mSDsCounter, 0 mSdLazyCounter, 5618 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8026 SdHoareTripleChecker+Valid, 6489 SdHoareTripleChecker+Invalid, 6337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 5618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:58,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8026 Valid, 6489 Invalid, 6337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 5618 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2025-02-06 02:38:58,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3599 states. [2025-02-06 02:38:58,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3599 to 1204. [2025-02-06 02:38:58,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 993 states have (on average 1.5730110775427997) internal successors, (1562), 994 states have internal predecessors, (1562), 206 states have call successors, (206), 4 states have call predecessors, (206), 4 states have return successors, (206), 205 states have call predecessors, (206), 206 states have call successors, (206) [2025-02-06 02:38:58,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1974 transitions. [2025-02-06 02:38:58,445 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1974 transitions. Word has length 545 [2025-02-06 02:38:58,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:58,449 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1974 transitions. [2025-02-06 02:38:58,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 19 states have internal predecessors, (148), 5 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) [2025-02-06 02:38:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1974 transitions. [2025-02-06 02:38:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-02-06 02:38:58,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:58,458 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:58,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:38:58,459 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:58,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:58,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1136024060, now seen corresponding path program 1 times [2025-02-06 02:38:58,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:58,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981279199] [2025-02-06 02:38:58,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:58,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:58,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-06 02:38:58,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-06 02:38:58,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:58,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-06 02:38:59,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:59,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981279199] [2025-02-06 02:38:59,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981279199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:59,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:59,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 02:38:59,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914486591] [2025-02-06 02:38:59,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:59,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:38:59,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:59,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:38:59,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:38:59,598 INFO L87 Difference]: Start difference. First operand 1204 states and 1974 transitions. Second operand has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 3 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 3 states have call predecessors, (80), 3 states have call successors, (80) [2025-02-06 02:39:01,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:01,296 INFO L93 Difference]: Finished difference Result 3439 states and 5628 transitions. [2025-02-06 02:39:01,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:39:01,297 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 3 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 3 states have call predecessors, (80), 3 states have call successors, (80) Word has length 545 [2025-02-06 02:39:01,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:01,307 INFO L225 Difference]: With dead ends: 3439 [2025-02-06 02:39:01,307 INFO L226 Difference]: Without dead ends: 2626 [2025-02-06 02:39:01,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-02-06 02:39:01,311 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 1365 mSDsluCounter, 3863 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 4646 SdHoareTripleChecker+Invalid, 2068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:01,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1365 Valid, 4646 Invalid, 2068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1757 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 02:39:01,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states. [2025-02-06 02:39:01,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 1546. [2025-02-06 02:39:01,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1335 states have (on average 1.6112359550561797) internal successors, (2151), 1336 states have internal predecessors, (2151), 206 states have call successors, (206), 4 states have call predecessors, (206), 4 states have return successors, (206), 205 states have call predecessors, (206), 206 states have call successors, (206) [2025-02-06 02:39:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2563 transitions. [2025-02-06 02:39:01,400 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2563 transitions. Word has length 545 [2025-02-06 02:39:01,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:01,401 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2563 transitions. [2025-02-06 02:39:01,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 3 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 3 states have call predecessors, (80), 3 states have call successors, (80) [2025-02-06 02:39:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2563 transitions. [2025-02-06 02:39:01,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-02-06 02:39:01,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:01,407 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:01,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:39:01,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:01,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:01,408 INFO L85 PathProgramCache]: Analyzing trace with hash -239469798, now seen corresponding path program 1 times [2025-02-06 02:39:01,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:01,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427365688] [2025-02-06 02:39:01,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:01,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:01,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-06 02:39:01,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-06 02:39:01,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:01,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:01,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-06 02:39:01,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:01,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427365688] [2025-02-06 02:39:01,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427365688] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:01,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:01,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:39:01,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111613000] [2025-02-06 02:39:01,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:01,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:39:01,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:01,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:39:01,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:01,566 INFO L87 Difference]: Start difference. First operand 1546 states and 2563 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-06 02:39:01,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:01,685 INFO L93 Difference]: Finished difference Result 3601 states and 5974 transitions. [2025-02-06 02:39:01,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:39:01,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 545 [2025-02-06 02:39:01,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:01,695 INFO L225 Difference]: With dead ends: 3601 [2025-02-06 02:39:01,695 INFO L226 Difference]: Without dead ends: 2555 [2025-02-06 02:39:01,697 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:39:01,698 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 582 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:01,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 1111 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:39:01,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2025-02-06 02:39:01,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2553. [2025-02-06 02:39:01,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2553 states, 2214 states have (on average 1.5998193315266487) internal successors, (3542), 2216 states have internal predecessors, (3542), 332 states have call successors, (332), 6 states have call predecessors, (332), 6 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2025-02-06 02:39:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 4206 transitions. [2025-02-06 02:39:01,790 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 4206 transitions. Word has length 545 [2025-02-06 02:39:01,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:01,790 INFO L471 AbstractCegarLoop]: Abstraction has 2553 states and 4206 transitions. [2025-02-06 02:39:01,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-06 02:39:01,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 4206 transitions. [2025-02-06 02:39:01,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-02-06 02:39:01,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:01,798 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:01,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:39:01,798 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:01,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:01,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1940210277, now seen corresponding path program 1 times [2025-02-06 02:39:01,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:01,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929020910] [2025-02-06 02:39:01,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:01,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:01,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-06 02:39:01,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-06 02:39:01,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:01,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:01,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-06 02:39:01,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:01,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929020910] [2025-02-06 02:39:01,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929020910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:01,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:01,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:39:01,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077853810] [2025-02-06 02:39:01,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:01,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:39:01,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:01,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:39:01,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:01,952 INFO L87 Difference]: Start difference. First operand 2553 states and 4206 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-06 02:39:02,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:02,081 INFO L93 Difference]: Finished difference Result 4410 states and 7253 transitions. [2025-02-06 02:39:02,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:39:02,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 545 [2025-02-06 02:39:02,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:02,094 INFO L225 Difference]: With dead ends: 4410 [2025-02-06 02:39:02,094 INFO L226 Difference]: Without dead ends: 2559 [2025-02-06 02:39:02,099 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:39:02,100 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 578 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:02,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 1549 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:39:02,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2559 states. [2025-02-06 02:39:02,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2559 to 2555. [2025-02-06 02:39:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2216 states have (on average 1.5875451263537905) internal successors, (3518), 2218 states have internal predecessors, (3518), 332 states have call successors, (332), 6 states have call predecessors, (332), 6 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2025-02-06 02:39:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 4182 transitions. [2025-02-06 02:39:02,205 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 4182 transitions. Word has length 545 [2025-02-06 02:39:02,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:02,207 INFO L471 AbstractCegarLoop]: Abstraction has 2555 states and 4182 transitions. [2025-02-06 02:39:02,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-06 02:39:02,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 4182 transitions. [2025-02-06 02:39:02,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-02-06 02:39:02,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:02,214 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:02,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:39:02,215 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:02,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:02,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1906060380, now seen corresponding path program 1 times [2025-02-06 02:39:02,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:02,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56731655] [2025-02-06 02:39:02,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:02,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:02,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-06 02:39:02,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-06 02:39:02,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:02,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-06 02:39:02,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:02,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56731655] [2025-02-06 02:39:02,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56731655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:02,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:02,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:39:02,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954530524] [2025-02-06 02:39:02,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:02,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:39:02,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:02,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:39:02,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:02,552 INFO L87 Difference]: Start difference. First operand 2555 states and 4182 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-06 02:39:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:02,708 INFO L93 Difference]: Finished difference Result 5300 states and 8653 transitions. [2025-02-06 02:39:02,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:39:02,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 545 [2025-02-06 02:39:02,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:02,724 INFO L225 Difference]: With dead ends: 5300 [2025-02-06 02:39:02,725 INFO L226 Difference]: Without dead ends: 3594 [2025-02-06 02:39:02,730 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:39:02,731 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 387 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:02,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1292 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:39:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2025-02-06 02:39:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3584. [2025-02-06 02:39:02,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3584 states, 3117 states have (on average 1.5838947706127686) internal successors, (4937), 3120 states have internal predecessors, (4937), 458 states have call successors, (458), 8 states have call predecessors, (458), 8 states have return successors, (458), 455 states have call predecessors, (458), 458 states have call successors, (458) [2025-02-06 02:39:02,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 5853 transitions. [2025-02-06 02:39:02,902 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 5853 transitions. Word has length 545 [2025-02-06 02:39:02,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:02,903 INFO L471 AbstractCegarLoop]: Abstraction has 3584 states and 5853 transitions. [2025-02-06 02:39:02,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-06 02:39:02,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 5853 transitions. [2025-02-06 02:39:02,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-02-06 02:39:02,909 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:02,909 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:02,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:39:02,909 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:02,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:02,910 INFO L85 PathProgramCache]: Analyzing trace with hash -302854566, now seen corresponding path program 1 times [2025-02-06 02:39:02,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:02,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854965253] [2025-02-06 02:39:02,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:02,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:02,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-06 02:39:03,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-06 02:39:03,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:03,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-06 02:39:03,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:03,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854965253] [2025-02-06 02:39:03,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854965253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:03,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:03,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:39:03,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409231680] [2025-02-06 02:39:03,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:03,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:39:03,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:03,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:39:03,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:39:03,776 INFO L87 Difference]: Start difference. First operand 3584 states and 5853 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-06 02:39:04,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:04,882 INFO L93 Difference]: Finished difference Result 12035 states and 19515 transitions. [2025-02-06 02:39:04,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:39:04,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 545 [2025-02-06 02:39:04,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:04,923 INFO L225 Difference]: With dead ends: 12035 [2025-02-06 02:39:04,926 INFO L226 Difference]: Without dead ends: 8974 [2025-02-06 02:39:04,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:39:04,935 INFO L435 NwaCegarLoop]: 1102 mSDtfsCounter, 1419 mSDsluCounter, 2919 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1419 SdHoareTripleChecker+Valid, 4021 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:04,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1419 Valid, 4021 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:39:04,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8974 states. [2025-02-06 02:39:05,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8974 to 4659. [2025-02-06 02:39:05,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4659 states, 4330 states have (on average 1.6187066974595843) internal successors, (7009), 4330 states have internal predecessors, (7009), 320 states have call successors, (320), 8 states have call predecessors, (320), 8 states have return successors, (320), 320 states have call predecessors, (320), 320 states have call successors, (320) [2025-02-06 02:39:05,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 7649 transitions. [2025-02-06 02:39:05,161 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 7649 transitions. Word has length 545 [2025-02-06 02:39:05,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:05,162 INFO L471 AbstractCegarLoop]: Abstraction has 4659 states and 7649 transitions. [2025-02-06 02:39:05,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-06 02:39:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 7649 transitions. [2025-02-06 02:39:05,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-02-06 02:39:05,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:05,174 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:05,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:39:05,174 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:05,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:05,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1723755738, now seen corresponding path program 1 times [2025-02-06 02:39:05,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:05,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426765778] [2025-02-06 02:39:05,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:05,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:05,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-06 02:39:05,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-06 02:39:05,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:05,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:06,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-06 02:39:06,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:06,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426765778] [2025-02-06 02:39:06,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426765778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:06,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:06,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:39:06,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249089171] [2025-02-06 02:39:06,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:06,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:39:06,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:06,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:39:06,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:39:06,229 INFO L87 Difference]: Start difference. First operand 4659 states and 7649 transitions. Second operand has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-02-06 02:39:07,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:07,789 INFO L93 Difference]: Finished difference Result 13015 states and 21122 transitions. [2025-02-06 02:39:07,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:39:07,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) Word has length 545 [2025-02-06 02:39:07,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:07,823 INFO L225 Difference]: With dead ends: 13015 [2025-02-06 02:39:07,823 INFO L226 Difference]: Without dead ends: 11125 [2025-02-06 02:39:07,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:39:07,831 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 2870 mSDsluCounter, 2391 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2870 SdHoareTripleChecker+Valid, 3227 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:07,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2870 Valid, 3227 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 02:39:07,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11125 states. [2025-02-06 02:39:08,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11125 to 10198. [2025-02-06 02:39:08,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10198 states, 9571 states have (on average 1.6085048584264967) internal successors, (15395), 9574 states have internal predecessors, (15395), 608 states have call successors, (608), 18 states have call predecessors, (608), 18 states have return successors, (608), 605 states have call predecessors, (608), 608 states have call successors, (608) [2025-02-06 02:39:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10198 states to 10198 states and 16611 transitions. [2025-02-06 02:39:08,123 INFO L78 Accepts]: Start accepts. Automaton has 10198 states and 16611 transitions. Word has length 545 [2025-02-06 02:39:08,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:08,123 INFO L471 AbstractCegarLoop]: Abstraction has 10198 states and 16611 transitions. [2025-02-06 02:39:08,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-02-06 02:39:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand 10198 states and 16611 transitions. [2025-02-06 02:39:08,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-02-06 02:39:08,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:08,132 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:08,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:39:08,133 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:08,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:08,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1691996346, now seen corresponding path program 1 times [2025-02-06 02:39:08,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:08,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58623937] [2025-02-06 02:39:08,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:08,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:08,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-06 02:39:08,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-06 02:39:08,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:08,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:08,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-06 02:39:08,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:08,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58623937] [2025-02-06 02:39:08,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58623937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:08,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:08,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:39:08,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798814538] [2025-02-06 02:39:08,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:08,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:39:08,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:08,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:39:08,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:39:08,798 INFO L87 Difference]: Start difference. First operand 10198 states and 16611 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-06 02:39:09,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:09,568 INFO L93 Difference]: Finished difference Result 27647 states and 44911 transitions. [2025-02-06 02:39:09,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:39:09,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 545 [2025-02-06 02:39:09,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:09,610 INFO L225 Difference]: With dead ends: 27647 [2025-02-06 02:39:09,610 INFO L226 Difference]: Without dead ends: 17787 [2025-02-06 02:39:09,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:39:09,628 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 795 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:09,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 1976 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:39:09,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17787 states. [2025-02-06 02:39:10,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17787 to 13904. [2025-02-06 02:39:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13904 states, 12734 states have (on average 1.579550808858175) internal successors, (20114), 12740 states have internal predecessors, (20114), 1136 states have call successors, (1136), 33 states have call predecessors, (1136), 33 states have return successors, (1136), 1130 states have call predecessors, (1136), 1136 states have call successors, (1136) [2025-02-06 02:39:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13904 states to 13904 states and 22386 transitions. [2025-02-06 02:39:10,101 INFO L78 Accepts]: Start accepts. Automaton has 13904 states and 22386 transitions. Word has length 545 [2025-02-06 02:39:10,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:10,102 INFO L471 AbstractCegarLoop]: Abstraction has 13904 states and 22386 transitions. [2025-02-06 02:39:10,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-06 02:39:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 13904 states and 22386 transitions. [2025-02-06 02:39:10,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-02-06 02:39:10,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:10,111 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:10,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:39:10,111 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:10,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:10,111 INFO L85 PathProgramCache]: Analyzing trace with hash -987011878, now seen corresponding path program 1 times [2025-02-06 02:39:10,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:10,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632695276] [2025-02-06 02:39:10,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:10,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:10,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-02-06 02:39:10,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-02-06 02:39:10,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:10,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-06 02:39:10,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:10,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632695276] [2025-02-06 02:39:10,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632695276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:10,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:10,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:39:10,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592050614] [2025-02-06 02:39:10,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:10,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:39:10,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:10,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:39:10,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:39:10,905 INFO L87 Difference]: Start difference. First operand 13904 states and 22386 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-06 02:39:12,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:12,402 INFO L93 Difference]: Finished difference Result 47438 states and 76125 transitions. [2025-02-06 02:39:12,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:39:12,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 546 [2025-02-06 02:39:12,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:12,471 INFO L225 Difference]: With dead ends: 47438 [2025-02-06 02:39:12,472 INFO L226 Difference]: Without dead ends: 36493 [2025-02-06 02:39:12,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:39:12,497 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 1072 mSDsluCounter, 1807 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 2313 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:12,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 2313 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 02:39:12,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36493 states. [2025-02-06 02:39:13,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36493 to 36433. [2025-02-06 02:39:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36433 states, 34937 states have (on average 1.5885164725076566) internal successors, (55498), 34997 states have internal predecessors, (55498), 1406 states have call successors, (1406), 89 states have call predecessors, (1406), 89 states have return successors, (1406), 1346 states have call predecessors, (1406), 1406 states have call successors, (1406) [2025-02-06 02:39:13,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36433 states to 36433 states and 58310 transitions. [2025-02-06 02:39:13,650 INFO L78 Accepts]: Start accepts. Automaton has 36433 states and 58310 transitions. Word has length 546 [2025-02-06 02:39:13,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:13,651 INFO L471 AbstractCegarLoop]: Abstraction has 36433 states and 58310 transitions. [2025-02-06 02:39:13,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-06 02:39:13,652 INFO L276 IsEmpty]: Start isEmpty. Operand 36433 states and 58310 transitions. [2025-02-06 02:39:13,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-02-06 02:39:13,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:13,678 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:13,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:39:13,678 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:13,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:13,679 INFO L85 PathProgramCache]: Analyzing trace with hash 862842680, now seen corresponding path program 1 times [2025-02-06 02:39:13,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:13,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581843943] [2025-02-06 02:39:13,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:13,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:13,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-02-06 02:39:13,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-02-06 02:39:13,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:13,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-06 02:39:13,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:13,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581843943] [2025-02-06 02:39:13,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581843943] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:13,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:13,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:39:13,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077201829] [2025-02-06 02:39:13,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:13,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:39:13,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:13,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:39:13,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:13,884 INFO L87 Difference]: Start difference. First operand 36433 states and 58310 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-06 02:39:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:15,067 INFO L93 Difference]: Finished difference Result 89595 states and 142906 transitions. [2025-02-06 02:39:15,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:39:15,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 546 [2025-02-06 02:39:15,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:15,163 INFO L225 Difference]: With dead ends: 89595 [2025-02-06 02:39:15,163 INFO L226 Difference]: Without dead ends: 59033 [2025-02-06 02:39:15,190 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:39:15,191 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 477 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:15,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1336 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:39:15,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59033 states. [2025-02-06 02:39:16,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59033 to 51957. [2025-02-06 02:39:16,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51957 states, 50461 states have (on average 1.5903569092962881) internal successors, (80251), 50521 states have internal predecessors, (80251), 1406 states have call successors, (1406), 89 states have call predecessors, (1406), 89 states have return successors, (1406), 1346 states have call predecessors, (1406), 1406 states have call successors, (1406) [2025-02-06 02:39:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51957 states to 51957 states and 83063 transitions. [2025-02-06 02:39:16,290 INFO L78 Accepts]: Start accepts. Automaton has 51957 states and 83063 transitions. Word has length 546 [2025-02-06 02:39:16,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:16,291 INFO L471 AbstractCegarLoop]: Abstraction has 51957 states and 83063 transitions. [2025-02-06 02:39:16,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-06 02:39:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 51957 states and 83063 transitions. [2025-02-06 02:39:16,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-02-06 02:39:16,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:16,318 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:16,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:39:16,319 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:16,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:16,319 INFO L85 PathProgramCache]: Analyzing trace with hash 220906297, now seen corresponding path program 1 times [2025-02-06 02:39:16,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:16,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275082510] [2025-02-06 02:39:16,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:16,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:16,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-02-06 02:39:17,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-02-06 02:39:17,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:17,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 27 proven. 210 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-02-06 02:39:18,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:18,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275082510] [2025-02-06 02:39:18,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275082510] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:39:18,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894257929] [2025-02-06 02:39:18,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:18,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:39:18,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:39:18,063 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:39:18,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:39:18,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-02-06 02:39:18,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-02-06 02:39:18,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:18,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:18,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 1315 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:39:18,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:39:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 2617 proven. 210 refuted. 0 times theorem prover too weak. 9813 trivial. 0 not checked. [2025-02-06 02:39:19,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:39:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 27 proven. 210 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-02-06 02:39:19,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894257929] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:39:19,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:39:19,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-06 02:39:19,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786911940] [2025-02-06 02:39:19,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:39:19,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:39:19,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:19,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:39:19,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:39:19,691 INFO L87 Difference]: Start difference. First operand 51957 states and 83063 transitions. Second operand has 8 states, 8 states have (on average 33.0) internal successors, (264), 8 states have internal predecessors, (264), 3 states have call successors, (220), 2 states have call predecessors, (220), 4 states have return successors, (221), 3 states have call predecessors, (221), 3 states have call successors, (221) [2025-02-06 02:39:20,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:20,848 INFO L93 Difference]: Finished difference Result 90602 states and 144591 transitions. [2025-02-06 02:39:20,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:39:20,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 33.0) internal successors, (264), 8 states have internal predecessors, (264), 3 states have call successors, (220), 2 states have call predecessors, (220), 4 states have return successors, (221), 3 states have call predecessors, (221), 3 states have call successors, (221) Word has length 546 [2025-02-06 02:39:20,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:20,938 INFO L225 Difference]: With dead ends: 90602 [2025-02-06 02:39:20,938 INFO L226 Difference]: Without dead ends: 49503 [2025-02-06 02:39:20,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1098 GetRequests, 1089 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:39:20,994 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 640 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:20,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1142 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:39:21,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49503 states. [2025-02-06 02:39:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49503 to 47953. [2025-02-06 02:39:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47953 states, 46516 states have (on average 1.5908289620775646) internal successors, (73999), 46564 states have internal predecessors, (73999), 1334 states have call successors, (1334), 102 states have call predecessors, (1334), 102 states have return successors, (1334), 1286 states have call predecessors, (1334), 1334 states have call successors, (1334) [2025-02-06 02:39:22,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47953 states to 47953 states and 76667 transitions. [2025-02-06 02:39:22,295 INFO L78 Accepts]: Start accepts. Automaton has 47953 states and 76667 transitions. Word has length 546 [2025-02-06 02:39:22,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:22,296 INFO L471 AbstractCegarLoop]: Abstraction has 47953 states and 76667 transitions. [2025-02-06 02:39:22,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 33.0) internal successors, (264), 8 states have internal predecessors, (264), 3 states have call successors, (220), 2 states have call predecessors, (220), 4 states have return successors, (221), 3 states have call predecessors, (221), 3 states have call successors, (221) [2025-02-06 02:39:22,297 INFO L276 IsEmpty]: Start isEmpty. Operand 47953 states and 76667 transitions. [2025-02-06 02:39:22,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-02-06 02:39:22,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:22,318 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:22,329 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:39:22,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:39:22,523 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:22,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:22,523 INFO L85 PathProgramCache]: Analyzing trace with hash -797283962, now seen corresponding path program 1 times [2025-02-06 02:39:22,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:22,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22087696] [2025-02-06 02:39:22,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:22,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:22,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-02-06 02:39:23,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-02-06 02:39:23,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:23,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:23,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 138 proven. 99 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-02-06 02:39:23,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:23,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22087696] [2025-02-06 02:39:23,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22087696] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:39:23,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835349077] [2025-02-06 02:39:23,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:23,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:39:23,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:39:23,970 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:39:23,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 02:39:24,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-02-06 02:39:24,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-02-06 02:39:24,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:24,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:24,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 1318 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 02:39:24,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:39:26,281 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 6498 proven. 201 refuted. 0 times theorem prover too weak. 5941 trivial. 0 not checked. [2025-02-06 02:39:26,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:39:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 267 proven. 204 refuted. 0 times theorem prover too weak. 12169 trivial. 0 not checked. [2025-02-06 02:39:27,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835349077] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:39:27,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:39:27,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 24 [2025-02-06 02:39:27,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669970349] [2025-02-06 02:39:27,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:39:27,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 02:39:27,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:27,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 02:39:27,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2025-02-06 02:39:27,323 INFO L87 Difference]: Start difference. First operand 47953 states and 76667 transitions. Second operand has 24 states, 24 states have (on average 10.958333333333334) internal successors, (263), 24 states have internal predecessors, (263), 7 states have call successors, (195), 4 states have call predecessors, (195), 9 states have return successors, (196), 7 states have call predecessors, (196), 7 states have call successors, (196) [2025-02-06 02:39:30,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:30,477 INFO L93 Difference]: Finished difference Result 75441 states and 119658 transitions. [2025-02-06 02:39:30,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 02:39:30,478 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 10.958333333333334) internal successors, (263), 24 states have internal predecessors, (263), 7 states have call successors, (195), 4 states have call predecessors, (195), 9 states have return successors, (196), 7 states have call predecessors, (196), 7 states have call successors, (196) Word has length 546 [2025-02-06 02:39:30,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:30,526 INFO L225 Difference]: With dead ends: 75441 [2025-02-06 02:39:30,526 INFO L226 Difference]: Without dead ends: 27822 [2025-02-06 02:39:30,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1123 GetRequests, 1076 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=473, Invalid=1879, Unknown=0, NotChecked=0, Total=2352 [2025-02-06 02:39:30,571 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 2504 mSDsluCounter, 6046 mSDsCounter, 0 mSdLazyCounter, 3797 mSolverCounterSat, 900 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2549 SdHoareTripleChecker+Valid, 6666 SdHoareTripleChecker+Invalid, 4697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 900 IncrementalHoareTripleChecker+Valid, 3797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:30,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2549 Valid, 6666 Invalid, 4697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [900 Valid, 3797 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-06 02:39:30,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27822 states. [2025-02-06 02:39:31,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27822 to 21154. [2025-02-06 02:39:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21154 states, 20093 states have (on average 1.5338675160503659) internal successors, (30820), 20135 states have internal predecessors, (30820), 969 states have call successors, (969), 91 states have call predecessors, (969), 91 states have return successors, (969), 927 states have call predecessors, (969), 969 states have call successors, (969) [2025-02-06 02:39:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21154 states to 21154 states and 32758 transitions. [2025-02-06 02:39:31,245 INFO L78 Accepts]: Start accepts. Automaton has 21154 states and 32758 transitions. Word has length 546 [2025-02-06 02:39:31,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:31,246 INFO L471 AbstractCegarLoop]: Abstraction has 21154 states and 32758 transitions. [2025-02-06 02:39:31,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.958333333333334) internal successors, (263), 24 states have internal predecessors, (263), 7 states have call successors, (195), 4 states have call predecessors, (195), 9 states have return successors, (196), 7 states have call predecessors, (196), 7 states have call successors, (196) [2025-02-06 02:39:31,246 INFO L276 IsEmpty]: Start isEmpty. Operand 21154 states and 32758 transitions. [2025-02-06 02:39:31,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2025-02-06 02:39:31,257 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:31,257 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:31,266 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:39:31,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:39:31,461 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:31,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:31,463 INFO L85 PathProgramCache]: Analyzing trace with hash 633214968, now seen corresponding path program 1 times [2025-02-06 02:39:31,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:31,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967868337] [2025-02-06 02:39:31,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:31,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:31,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-02-06 02:39:32,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-02-06 02:39:32,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:32,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:35,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 24 proven. 213 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-02-06 02:39:35,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:35,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967868337] [2025-02-06 02:39:35,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967868337] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:39:35,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517617820] [2025-02-06 02:39:35,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:35,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:39:35,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:39:35,183 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:39:35,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 02:39:35,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-02-06 02:39:35,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-02-06 02:39:35,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:35,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:35,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 1313 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 02:39:35,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:39:37,795 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 2689 proven. 414 refuted. 0 times theorem prover too weak. 9537 trivial. 0 not checked. [2025-02-06 02:39:37,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:39:38,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 54 proven. 417 refuted. 0 times theorem prover too weak. 12169 trivial. 0 not checked. [2025-02-06 02:39:38,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517617820] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:39:38,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:39:38,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 33 [2025-02-06 02:39:38,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693240398] [2025-02-06 02:39:38,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:39:38,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-06 02:39:38,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:38,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-06 02:39:38,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=854, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 02:39:38,577 INFO L87 Difference]: Start difference. First operand 21154 states and 32758 transitions. Second operand has 33 states, 32 states have (on average 12.90625) internal successors, (413), 31 states have internal predecessors, (413), 10 states have call successors, (240), 4 states have call predecessors, (240), 8 states have return successors, (240), 10 states have call predecessors, (240), 10 states have call successors, (240)