./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-51.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 01c992e168948c865774d6071204a719c87c2df20b1fe8dee696318794ef867b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:47:43,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:47:43,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:47:43,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:47:43,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:47:43,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:47:43,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:47:43,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:47:43,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:47:43,971 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:47:43,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:47:43,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:47:43,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:47:43,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:47:43,972 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:47:43,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:47:43,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:47:43,972 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:47:43,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:47:43,972 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:47:43,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:47:43,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:47:43,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:47:43,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:47:43,973 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:47:43,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:47:43,973 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:47:43,973 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:47:43,973 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:47:43,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:47:43,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:47:43,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:47:43,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:43,974 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:47:43,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:47:43,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:47:43,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:47:43,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:43,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:47:43,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:47:43,974 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:47:43,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:47:43,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:47:43,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:47:43,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:47:43,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:47:43,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:47:43,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:47:43,975 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 -> 01c992e168948c865774d6071204a719c87c2df20b1fe8dee696318794ef867b [2025-01-09 14:47:44,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:47:44,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:47:44,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:47:44,232 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:47:44,233 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:47:44,233 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-51.i [2025-01-09 14:47:45,410 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/360ad46d7/8c8a433bd95143c3aec19f2a6f93c182/FLAG2b30c2677 [2025-01-09 14:47:45,695 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:47:45,696 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-51.i [2025-01-09 14:47:45,712 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/360ad46d7/8c8a433bd95143c3aec19f2a6f93c182/FLAG2b30c2677 [2025-01-09 14:47:45,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/360ad46d7/8c8a433bd95143c3aec19f2a6f93c182 [2025-01-09 14:47:45,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:47:45,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:47:45,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:47:45,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:47:45,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:47:45,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:45" (1/1) ... [2025-01-09 14:47:45,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7deeaa03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:45, skipping insertion in model container [2025-01-09 14:47:45,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:45" (1/1) ... [2025-01-09 14:47:46,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:47:46,131 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-51.i[916,929] [2025-01-09 14:47:46,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:47:46,379 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:47:46,389 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-51.i[916,929] [2025-01-09 14:47:46,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:47:46,511 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:47:46,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:46 WrapperNode [2025-01-09 14:47:46,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:47:46,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:47:46,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:47:46,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:47:46,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:46" (1/1) ... [2025-01-09 14:47:46,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:46" (1/1) ... [2025-01-09 14:47:46,625 INFO L138 Inliner]: procedures = 26, calls = 100, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 703 [2025-01-09 14:47:46,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:47:46,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:47:46,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:47:46,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:47:46,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:46" (1/1) ... [2025-01-09 14:47:46,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:46" (1/1) ... [2025-01-09 14:47:46,662 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:46" (1/1) ... [2025-01-09 14:47:46,736 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:47:46,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:46" (1/1) ... [2025-01-09 14:47:46,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:46" (1/1) ... [2025-01-09 14:47:46,774 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:46" (1/1) ... [2025-01-09 14:47:46,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:46" (1/1) ... [2025-01-09 14:47:46,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:46" (1/1) ... [2025-01-09 14:47:46,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:46" (1/1) ... [2025-01-09 14:47:46,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:46" (1/1) ... [2025-01-09 14:47:46,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:47:46,815 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:47:46,815 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:47:46,815 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:47:46,816 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:46" (1/1) ... [2025-01-09 14:47:46,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:46,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:46,841 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:47:46,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:47:46,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:47:46,863 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:47:46,863 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:47:46,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:47:46,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:47:46,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:47:46,974 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:47:46,976 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:47:47,941 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-01-09 14:47:47,941 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:47:47,959 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:47:47,961 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:47:47,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:47 BoogieIcfgContainer [2025-01-09 14:47:47,961 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:47:47,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:47:47,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:47:47,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:47:47,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:47:45" (1/3) ... [2025-01-09 14:47:47,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d52fb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:47, skipping insertion in model container [2025-01-09 14:47:47,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:46" (2/3) ... [2025-01-09 14:47:47,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d52fb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:47, skipping insertion in model container [2025-01-09 14:47:47,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:47" (3/3) ... [2025-01-09 14:47:47,970 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-51.i [2025-01-09 14:47:47,982 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:47:47,987 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-51.i that has 2 procedures, 290 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:47:48,053 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:47:48,061 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;@34f08c2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:47:48,062 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:47:48,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 290 states, 200 states have (on average 1.555) internal successors, (311), 201 states have internal predecessors, (311), 87 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 14:47:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-01-09 14:47:48,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:48,090 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:47:48,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:48,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:48,098 INFO L85 PathProgramCache]: Analyzing trace with hash 743423726, now seen corresponding path program 1 times [2025-01-09 14:47:48,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:48,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284847703] [2025-01-09 14:47:48,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:48,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:48,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-01-09 14:47:48,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-01-09 14:47:48,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:48,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 14792 trivial. 0 not checked. [2025-01-09 14:47:48,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:48,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284847703] [2025-01-09 14:47:48,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284847703] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:48,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131813519] [2025-01-09 14:47:48,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:48,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:48,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:48,684 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:47:48,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:47:48,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-01-09 14:47:49,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-01-09 14:47:49,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:49,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:49,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 1321 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:47:49,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:49,088 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 14792 trivial. 0 not checked. [2025-01-09 14:47:49,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:47:49,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131813519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:49,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:47:49,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:47:49,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882706329] [2025-01-09 14:47:49,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:49,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:47:49,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:49,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:47:49,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:47:49,112 INFO L87 Difference]: Start difference. First operand has 290 states, 200 states have (on average 1.555) internal successors, (311), 201 states have internal predecessors, (311), 87 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) Second operand has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (87), 2 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 2 states have call successors, (87) [2025-01-09 14:47:49,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:49,162 INFO L93 Difference]: Finished difference Result 574 states and 1052 transitions. [2025-01-09 14:47:49,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:47:49,164 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (87), 2 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 2 states have call successors, (87) Word has length 567 [2025-01-09 14:47:49,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:49,171 INFO L225 Difference]: With dead ends: 574 [2025-01-09 14:47:49,171 INFO L226 Difference]: Without dead ends: 287 [2025-01-09 14:47:49,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:47:49,176 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:49,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:49,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-01-09 14:47:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2025-01-09 14:47:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 198 states have (on average 1.5454545454545454) internal successors, (306), 198 states have internal predecessors, (306), 87 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 14:47:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 480 transitions. [2025-01-09 14:47:49,236 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 480 transitions. Word has length 567 [2025-01-09 14:47:49,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:49,237 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 480 transitions. [2025-01-09 14:47:49,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (87), 2 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 2 states have call successors, (87) [2025-01-09 14:47:49,237 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 480 transitions. [2025-01-09 14:47:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-01-09 14:47:49,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:49,247 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:47:49,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:47:49,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:47:49,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:49,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:49,453 INFO L85 PathProgramCache]: Analyzing trace with hash -770223712, now seen corresponding path program 1 times [2025-01-09 14:47:49,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:49,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325177947] [2025-01-09 14:47:49,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:49,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:49,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-01-09 14:47:49,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-01-09 14:47:49,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:49,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:50,087 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-01-09 14:47:50,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:50,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325177947] [2025-01-09 14:47:50,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325177947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:50,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:50,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:50,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874981958] [2025-01-09 14:47:50,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:50,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:50,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:50,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:50,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:50,091 INFO L87 Difference]: Start difference. First operand 287 states and 480 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:47:50,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:50,205 INFO L93 Difference]: Finished difference Result 767 states and 1284 transitions. [2025-01-09 14:47:50,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:50,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 567 [2025-01-09 14:47:50,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:50,215 INFO L225 Difference]: With dead ends: 767 [2025-01-09 14:47:50,215 INFO L226 Difference]: Without dead ends: 483 [2025-01-09 14:47:50,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:50,217 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 317 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:50,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1059 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:50,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-01-09 14:47:50,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 480. [2025-01-09 14:47:50,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 344 states have (on average 1.563953488372093) internal successors, (538), 345 states have internal predecessors, (538), 133 states have call successors, (133), 2 states have call predecessors, (133), 2 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-01-09 14:47:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 804 transitions. [2025-01-09 14:47:50,276 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 804 transitions. Word has length 567 [2025-01-09 14:47:50,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:50,278 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 804 transitions. [2025-01-09 14:47:50,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:47:50,279 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 804 transitions. [2025-01-09 14:47:50,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-01-09 14:47:50,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:50,285 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:47:50,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:47:50,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:50,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:50,287 INFO L85 PathProgramCache]: Analyzing trace with hash -781039843, now seen corresponding path program 1 times [2025-01-09 14:47:50,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:50,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732044534] [2025-01-09 14:47:50,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:50,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:50,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-01-09 14:47:50,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-01-09 14:47:50,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:50,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-01-09 14:47:50,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:50,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732044534] [2025-01-09 14:47:50,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732044534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:50,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:50,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:50,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902026793] [2025-01-09 14:47:50,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:50,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:50,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:50,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:50,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:50,677 INFO L87 Difference]: Start difference. First operand 480 states and 804 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:47:50,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:50,793 INFO L93 Difference]: Finished difference Result 1426 states and 2390 transitions. [2025-01-09 14:47:50,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:50,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 568 [2025-01-09 14:47:50,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:50,805 INFO L225 Difference]: With dead ends: 1426 [2025-01-09 14:47:50,806 INFO L226 Difference]: Without dead ends: 949 [2025-01-09 14:47:50,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:50,808 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 462 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:50,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1286 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:50,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2025-01-09 14:47:50,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 609. [2025-01-09 14:47:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 473 states have (on average 1.6257928118393234) internal successors, (769), 474 states have internal predecessors, (769), 133 states have call successors, (133), 2 states have call predecessors, (133), 2 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-01-09 14:47:50,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1035 transitions. [2025-01-09 14:47:50,890 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1035 transitions. Word has length 568 [2025-01-09 14:47:50,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:50,894 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 1035 transitions. [2025-01-09 14:47:50,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:47:50,895 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1035 transitions. [2025-01-09 14:47:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-01-09 14:47:50,899 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:50,899 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:47:50,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:47:50,900 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:50,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:50,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1460312097, now seen corresponding path program 1 times [2025-01-09 14:47:50,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:50,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866562664] [2025-01-09 14:47:50,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:50,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:50,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-01-09 14:47:51,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-01-09 14:47:51,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:51,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:51,396 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-01-09 14:47:51,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:51,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866562664] [2025-01-09 14:47:51,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866562664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:51,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:51,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:51,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700321578] [2025-01-09 14:47:51,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:51,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:51,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:51,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:51,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:51,400 INFO L87 Difference]: Start difference. First operand 609 states and 1035 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:47:51,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:51,489 INFO L93 Difference]: Finished difference Result 1809 states and 3075 transitions. [2025-01-09 14:47:51,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:51,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 568 [2025-01-09 14:47:51,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:51,498 INFO L225 Difference]: With dead ends: 1809 [2025-01-09 14:47:51,498 INFO L226 Difference]: Without dead ends: 1203 [2025-01-09 14:47:51,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:51,502 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 441 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:51,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1100 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:51,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2025-01-09 14:47:51,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1201. [2025-01-09 14:47:51,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 930 states have (on average 1.613978494623656) internal successors, (1501), 932 states have internal predecessors, (1501), 266 states have call successors, (266), 4 states have call predecessors, (266), 4 states have return successors, (266), 264 states have call predecessors, (266), 266 states have call successors, (266) [2025-01-09 14:47:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 2033 transitions. [2025-01-09 14:47:51,653 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 2033 transitions. Word has length 568 [2025-01-09 14:47:51,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:51,654 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 2033 transitions. [2025-01-09 14:47:51,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:47:51,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 2033 transitions. [2025-01-09 14:47:51,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-01-09 14:47:51,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:51,660 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:47:51,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:47:51,660 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:51,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:51,661 INFO L85 PathProgramCache]: Analyzing trace with hash -621278435, now seen corresponding path program 1 times [2025-01-09 14:47:51,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:51,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027627066] [2025-01-09 14:47:51,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:51,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:51,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-01-09 14:47:51,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-01-09 14:47:51,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:51,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-01-09 14:47:51,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:51,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027627066] [2025-01-09 14:47:51,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027627066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:51,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:51,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:51,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166792695] [2025-01-09 14:47:51,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:51,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:51,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:51,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:51,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:51,958 INFO L87 Difference]: Start difference. First operand 1201 states and 2033 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:47:52,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:52,116 INFO L93 Difference]: Finished difference Result 3565 states and 6037 transitions. [2025-01-09 14:47:52,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:52,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 568 [2025-01-09 14:47:52,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:52,135 INFO L225 Difference]: With dead ends: 3565 [2025-01-09 14:47:52,135 INFO L226 Difference]: Without dead ends: 2367 [2025-01-09 14:47:52,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:52,140 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 438 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:52,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 941 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2025-01-09 14:47:52,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2319. [2025-01-09 14:47:52,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2319 states, 1778 states have (on average 1.5860517435320585) internal successors, (2820), 1782 states have internal predecessors, (2820), 532 states have call successors, (532), 8 states have call predecessors, (532), 8 states have return successors, (532), 528 states have call predecessors, (532), 532 states have call successors, (532) [2025-01-09 14:47:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 3884 transitions. [2025-01-09 14:47:52,365 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 3884 transitions. Word has length 568 [2025-01-09 14:47:52,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:52,366 INFO L471 AbstractCegarLoop]: Abstraction has 2319 states and 3884 transitions. [2025-01-09 14:47:52,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:47:52,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 3884 transitions. [2025-01-09 14:47:52,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-01-09 14:47:52,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:52,371 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:47:52,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:47:52,371 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:52,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:52,372 INFO L85 PathProgramCache]: Analyzing trace with hash -767971237, now seen corresponding path program 1 times [2025-01-09 14:47:52,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:52,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743019351] [2025-01-09 14:47:52,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:52,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:52,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-01-09 14:47:52,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-01-09 14:47:52,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:52,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:52,672 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-01-09 14:47:52,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:52,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743019351] [2025-01-09 14:47:52,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743019351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:52,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:52,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:52,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449735779] [2025-01-09 14:47:52,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:52,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:52,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:52,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:52,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:52,674 INFO L87 Difference]: Start difference. First operand 2319 states and 3884 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:47:52,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:52,854 INFO L93 Difference]: Finished difference Result 6651 states and 11132 transitions. [2025-01-09 14:47:52,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:52,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 568 [2025-01-09 14:47:52,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:52,880 INFO L225 Difference]: With dead ends: 6651 [2025-01-09 14:47:52,880 INFO L226 Difference]: Without dead ends: 4335 [2025-01-09 14:47:52,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:52,889 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 302 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:52,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1089 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:52,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4335 states. [2025-01-09 14:47:53,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4335 to 4329. [2025-01-09 14:47:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4329 states, 3372 states have (on average 1.5901542111506524) internal successors, (5362), 3384 states have internal predecessors, (5362), 940 states have call successors, (940), 16 states have call predecessors, (940), 16 states have return successors, (940), 928 states have call predecessors, (940), 940 states have call successors, (940) [2025-01-09 14:47:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4329 states to 4329 states and 7242 transitions. [2025-01-09 14:47:53,186 INFO L78 Accepts]: Start accepts. Automaton has 4329 states and 7242 transitions. Word has length 568 [2025-01-09 14:47:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:53,187 INFO L471 AbstractCegarLoop]: Abstraction has 4329 states and 7242 transitions. [2025-01-09 14:47:53,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:47:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4329 states and 7242 transitions. [2025-01-09 14:47:53,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-01-09 14:47:53,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:53,194 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:47:53,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:47:53,194 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:53,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:53,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1226173469, now seen corresponding path program 1 times [2025-01-09 14:47:53,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:53,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781398692] [2025-01-09 14:47:53,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:53,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:53,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-01-09 14:47:53,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-01-09 14:47:53,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:53,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:53,926 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-01-09 14:47:53,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:53,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781398692] [2025-01-09 14:47:53,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781398692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:53,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:53,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:53,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204592622] [2025-01-09 14:47:53,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:53,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:53,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:53,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:53,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:53,929 INFO L87 Difference]: Start difference. First operand 4329 states and 7242 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:47:54,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:54,287 INFO L93 Difference]: Finished difference Result 12741 states and 21318 transitions. [2025-01-09 14:47:54,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:54,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 568 [2025-01-09 14:47:54,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:54,336 INFO L225 Difference]: With dead ends: 12741 [2025-01-09 14:47:54,336 INFO L226 Difference]: Without dead ends: 8415 [2025-01-09 14:47:54,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:54,351 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 319 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:54,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1024 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:54,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8415 states. [2025-01-09 14:47:54,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8415 to 8409. [2025-01-09 14:47:54,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8409 states, 6496 states have (on average 1.5855911330049262) internal successors, (10300), 6520 states have internal predecessors, (10300), 1880 states have call successors, (1880), 32 states have call predecessors, (1880), 32 states have return successors, (1880), 1856 states have call predecessors, (1880), 1880 states have call successors, (1880) [2025-01-09 14:47:54,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8409 states to 8409 states and 14060 transitions. [2025-01-09 14:47:54,905 INFO L78 Accepts]: Start accepts. Automaton has 8409 states and 14060 transitions. Word has length 568 [2025-01-09 14:47:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:54,906 INFO L471 AbstractCegarLoop]: Abstraction has 8409 states and 14060 transitions. [2025-01-09 14:47:54,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:47:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 8409 states and 14060 transitions. [2025-01-09 14:47:54,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-01-09 14:47:54,913 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:54,914 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:47:54,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:47:54,914 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:54,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:54,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1107219169, now seen corresponding path program 1 times [2025-01-09 14:47:54,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:54,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145033712] [2025-01-09 14:47:54,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:54,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:54,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-01-09 14:47:55,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-01-09 14:47:55,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:55,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:55,554 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-01-09 14:47:55,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:55,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145033712] [2025-01-09 14:47:55,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145033712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:55,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:55,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:55,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99479688] [2025-01-09 14:47:55,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:55,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:55,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:55,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:55,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:55,556 INFO L87 Difference]: Start difference. First operand 8409 states and 14060 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:47:56,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:56,153 INFO L93 Difference]: Finished difference Result 25221 states and 42174 transitions. [2025-01-09 14:47:56,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:56,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 568 [2025-01-09 14:47:56,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:56,245 INFO L225 Difference]: With dead ends: 25221 [2025-01-09 14:47:56,246 INFO L226 Difference]: Without dead ends: 16815 [2025-01-09 14:47:56,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:56,267 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 300 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:56,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 949 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:56,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16815 states. [2025-01-09 14:47:57,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16815 to 16813. [2025-01-09 14:47:57,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16813 states, 12988 states have (on average 1.5808438558669542) internal successors, (20532), 13036 states have internal predecessors, (20532), 3760 states have call successors, (3760), 64 states have call predecessors, (3760), 64 states have return successors, (3760), 3712 states have call predecessors, (3760), 3760 states have call successors, (3760) [2025-01-09 14:47:57,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16813 states to 16813 states and 28052 transitions. [2025-01-09 14:47:57,221 INFO L78 Accepts]: Start accepts. Automaton has 16813 states and 28052 transitions. Word has length 568 [2025-01-09 14:47:57,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:57,222 INFO L471 AbstractCegarLoop]: Abstraction has 16813 states and 28052 transitions. [2025-01-09 14:47:57,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:47:57,223 INFO L276 IsEmpty]: Start isEmpty. Operand 16813 states and 28052 transitions. [2025-01-09 14:47:57,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-01-09 14:47:57,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:57,233 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:47:57,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:47:57,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:57,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:57,234 INFO L85 PathProgramCache]: Analyzing trace with hash -859072675, now seen corresponding path program 1 times [2025-01-09 14:47:57,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:57,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727797528] [2025-01-09 14:47:57,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:57,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:57,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-01-09 14:47:57,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-01-09 14:47:57,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:57,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:58,060 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-01-09 14:47:58,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:58,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727797528] [2025-01-09 14:47:58,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727797528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:58,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:58,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:47:58,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141018420] [2025-01-09 14:47:58,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:58,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:47:58,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:58,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:47:58,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:47:58,063 INFO L87 Difference]: Start difference. First operand 16813 states and 28052 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 2 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87) [2025-01-09 14:47:59,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:59,413 INFO L93 Difference]: Finished difference Result 38353 states and 64067 transitions. [2025-01-09 14:47:59,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:47:59,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 2 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87) Word has length 568 [2025-01-09 14:47:59,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:59,495 INFO L225 Difference]: With dead ends: 38353 [2025-01-09 14:47:59,495 INFO L226 Difference]: Without dead ends: 21543 [2025-01-09 14:47:59,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:47:59,551 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 652 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:59,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1623 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:47:59,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21543 states. [2025-01-09 14:48:00,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21543 to 17791. [2025-01-09 14:48:00,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17791 states, 13878 states have (on average 1.5808473843493298) internal successors, (21939), 13926 states have internal predecessors, (21939), 3847 states have call successors, (3847), 65 states have call predecessors, (3847), 65 states have return successors, (3847), 3799 states have call predecessors, (3847), 3847 states have call successors, (3847) [2025-01-09 14:48:00,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17791 states to 17791 states and 29633 transitions. [2025-01-09 14:48:00,751 INFO L78 Accepts]: Start accepts. Automaton has 17791 states and 29633 transitions. Word has length 568 [2025-01-09 14:48:00,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:00,752 INFO L471 AbstractCegarLoop]: Abstraction has 17791 states and 29633 transitions. [2025-01-09 14:48:00,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 2 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87) [2025-01-09 14:48:00,752 INFO L276 IsEmpty]: Start isEmpty. Operand 17791 states and 29633 transitions. [2025-01-09 14:48:00,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-01-09 14:48:00,760 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:00,761 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:48:00,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:48:00,761 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:00,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:00,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1515278612, now seen corresponding path program 1 times [2025-01-09 14:48:00,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:00,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779927948] [2025-01-09 14:48:00,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:00,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:00,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-01-09 14:48:01,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-01-09 14:48:01,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:01,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-01-09 14:48:01,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:01,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779927948] [2025-01-09 14:48:01,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779927948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:01,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:01,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:48:01,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511088150] [2025-01-09 14:48:01,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:01,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:48:01,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:01,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:48:01,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:48:01,859 INFO L87 Difference]: Start difference. First operand 17791 states and 29633 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:48:02,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:02,779 INFO L93 Difference]: Finished difference Result 33025 states and 55056 transitions. [2025-01-09 14:48:02,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:48:02,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 569 [2025-01-09 14:48:02,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:02,839 INFO L225 Difference]: With dead ends: 33025 [2025-01-09 14:48:02,840 INFO L226 Difference]: Without dead ends: 16127 [2025-01-09 14:48:02,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:48:02,880 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 749 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:02,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 1730 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:48:02,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16127 states. [2025-01-09 14:48:03,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16127 to 16099. [2025-01-09 14:48:03,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16099 states, 12474 states have (on average 1.5737534070867405) internal successors, (19631), 12514 states have internal predecessors, (19631), 3559 states have call successors, (3559), 65 states have call predecessors, (3559), 65 states have return successors, (3559), 3519 states have call predecessors, (3559), 3559 states have call successors, (3559) [2025-01-09 14:48:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16099 states to 16099 states and 26749 transitions. [2025-01-09 14:48:03,682 INFO L78 Accepts]: Start accepts. Automaton has 16099 states and 26749 transitions. Word has length 569 [2025-01-09 14:48:03,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:03,683 INFO L471 AbstractCegarLoop]: Abstraction has 16099 states and 26749 transitions. [2025-01-09 14:48:03,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:48:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand 16099 states and 26749 transitions. [2025-01-09 14:48:03,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-01-09 14:48:03,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:03,691 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:48:03,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:48:03,691 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:03,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:03,692 INFO L85 PathProgramCache]: Analyzing trace with hash -197435926, now seen corresponding path program 1 times [2025-01-09 14:48:03,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:03,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696985512] [2025-01-09 14:48:03,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:03,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:03,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-01-09 14:48:05,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-01-09 14:48:05,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:05,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 18 proven. 240 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-01-09 14:48:06,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:06,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696985512] [2025-01-09 14:48:06,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696985512] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:48:06,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053585144] [2025-01-09 14:48:06,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:06,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:06,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:06,046 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:48:06,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:48:06,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-01-09 14:48:06,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-01-09 14:48:06,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:06,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:06,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 14:48:06,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:48:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 5018 proven. 204 refuted. 0 times theorem prover too weak. 9742 trivial. 0 not checked. [2025-01-09 14:48:07,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:48:07,826 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 54 proven. 204 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-01-09 14:48:07,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053585144] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:48:07,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:48:07,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2025-01-09 14:48:07,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527135678] [2025-01-09 14:48:07,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:48:07,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 14:48:07,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:07,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 14:48:07,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:48:07,831 INFO L87 Difference]: Start difference. First operand 16099 states and 26749 transitions. Second operand has 16 states, 16 states have (on average 20.9375) internal successors, (335), 16 states have internal predecessors, (335), 5 states have call successors, (242), 2 states have call predecessors, (242), 4 states have return successors, (243), 5 states have call predecessors, (243), 5 states have call successors, (243) [2025-01-09 14:48:10,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:10,412 INFO L93 Difference]: Finished difference Result 51260 states and 84785 transitions. [2025-01-09 14:48:10,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-09 14:48:10,413 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 20.9375) internal successors, (335), 16 states have internal predecessors, (335), 5 states have call successors, (242), 2 states have call predecessors, (242), 4 states have return successors, (243), 5 states have call predecessors, (243), 5 states have call successors, (243) Word has length 569 [2025-01-09 14:48:10,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:10,530 INFO L225 Difference]: With dead ends: 51260 [2025-01-09 14:48:10,531 INFO L226 Difference]: Without dead ends: 35322 [2025-01-09 14:48:10,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1175 GetRequests, 1133 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=466, Invalid=1426, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 14:48:10,568 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 2525 mSDsluCounter, 2638 mSDsCounter, 0 mSdLazyCounter, 1834 mSolverCounterSat, 562 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2544 SdHoareTripleChecker+Valid, 2985 SdHoareTripleChecker+Invalid, 2396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 562 IncrementalHoareTripleChecker+Valid, 1834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:10,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2544 Valid, 2985 Invalid, 2396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [562 Valid, 1834 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 14:48:10,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35322 states. [2025-01-09 14:48:12,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35322 to 34016. [2025-01-09 14:48:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34016 states, 28876 states have (on average 1.6076326360991826) internal successors, (46422), 28972 states have internal predecessors, (46422), 4903 states have call successors, (4903), 236 states have call predecessors, (4903), 236 states have return successors, (4903), 4807 states have call predecessors, (4903), 4903 states have call successors, (4903) [2025-01-09 14:48:12,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34016 states to 34016 states and 56228 transitions. [2025-01-09 14:48:12,227 INFO L78 Accepts]: Start accepts. Automaton has 34016 states and 56228 transitions. Word has length 569 [2025-01-09 14:48:12,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:12,228 INFO L471 AbstractCegarLoop]: Abstraction has 34016 states and 56228 transitions. [2025-01-09 14:48:12,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 20.9375) internal successors, (335), 16 states have internal predecessors, (335), 5 states have call successors, (242), 2 states have call predecessors, (242), 4 states have return successors, (243), 5 states have call predecessors, (243), 5 states have call successors, (243) [2025-01-09 14:48:12,228 INFO L276 IsEmpty]: Start isEmpty. Operand 34016 states and 56228 transitions. [2025-01-09 14:48:12,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-01-09 14:48:12,244 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:12,244 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:48:12,255 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-01-09 14:48:12,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:12,445 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:12,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:12,445 INFO L85 PathProgramCache]: Analyzing trace with hash 604025005, now seen corresponding path program 1 times [2025-01-09 14:48:12,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:12,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523885977] [2025-01-09 14:48:12,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:12,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:12,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-01-09 14:48:12,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-01-09 14:48:12,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:12,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:12,632 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-01-09 14:48:12,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:12,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523885977] [2025-01-09 14:48:12,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523885977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:12,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:12,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:48:12,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946093784] [2025-01-09 14:48:12,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:12,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:48:12,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:12,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:48:12,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:48:12,634 INFO L87 Difference]: Start difference. First operand 34016 states and 56228 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:48:14,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:14,388 INFO L93 Difference]: Finished difference Result 94774 states and 156170 transitions. [2025-01-09 14:48:14,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:48:14,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 571 [2025-01-09 14:48:14,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:14,586 INFO L225 Difference]: With dead ends: 94774 [2025-01-09 14:48:14,586 INFO L226 Difference]: Without dead ends: 66401 [2025-01-09 14:48:14,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:48:14,637 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 403 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:14,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 930 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:48:14,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66401 states. [2025-01-09 14:48:16,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66401 to 52948. [2025-01-09 14:48:16,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52948 states, 47808 states have (on average 1.6403949129852744) internal successors, (78424), 47904 states have internal predecessors, (78424), 4903 states have call successors, (4903), 236 states have call predecessors, (4903), 236 states have return successors, (4903), 4807 states have call predecessors, (4903), 4903 states have call successors, (4903) [2025-01-09 14:48:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52948 states to 52948 states and 88230 transitions. [2025-01-09 14:48:16,812 INFO L78 Accepts]: Start accepts. Automaton has 52948 states and 88230 transitions. Word has length 571 [2025-01-09 14:48:16,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:16,813 INFO L471 AbstractCegarLoop]: Abstraction has 52948 states and 88230 transitions. [2025-01-09 14:48:16,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:48:16,813 INFO L276 IsEmpty]: Start isEmpty. Operand 52948 states and 88230 transitions. [2025-01-09 14:48:16,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-01-09 14:48:16,837 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:16,838 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:48:16,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:48:16,838 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:16,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:16,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1336632148, now seen corresponding path program 1 times [2025-01-09 14:48:16,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:16,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952809979] [2025-01-09 14:48:16,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:16,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:16,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-01-09 14:48:17,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-01-09 14:48:17,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:17,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-01-09 14:48:17,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:17,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952809979] [2025-01-09 14:48:17,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952809979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:17,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:17,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:48:17,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203696672] [2025-01-09 14:48:17,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:17,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:48:17,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:17,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:48:17,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:48:17,992 INFO L87 Difference]: Start difference. First operand 52948 states and 88230 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:48:20,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:20,779 INFO L93 Difference]: Finished difference Result 180753 states and 301159 transitions. [2025-01-09 14:48:20,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:48:20,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 571 [2025-01-09 14:48:20,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:21,020 INFO L225 Difference]: With dead ends: 180753 [2025-01-09 14:48:21,020 INFO L226 Difference]: Without dead ends: 120982 [2025-01-09 14:48:21,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:48:21,079 INFO L435 NwaCegarLoop]: 1595 mSDtfsCounter, 2381 mSDsluCounter, 4017 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2381 SdHoareTripleChecker+Valid, 5612 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:21,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2381 Valid, 5612 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:48:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120982 states. [2025-01-09 14:48:23,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120982 to 62664. [2025-01-09 14:48:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62664 states, 58551 states have (on average 1.6524226742497994) internal successors, (96751), 58611 states have internal predecessors, (96751), 3907 states have call successors, (3907), 205 states have call predecessors, (3907), 205 states have return successors, (3907), 3847 states have call predecessors, (3907), 3907 states have call successors, (3907) [2025-01-09 14:48:23,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62664 states to 62664 states and 104565 transitions. [2025-01-09 14:48:23,896 INFO L78 Accepts]: Start accepts. Automaton has 62664 states and 104565 transitions. Word has length 571 [2025-01-09 14:48:23,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:23,897 INFO L471 AbstractCegarLoop]: Abstraction has 62664 states and 104565 transitions. [2025-01-09 14:48:23,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:48:23,897 INFO L276 IsEmpty]: Start isEmpty. Operand 62664 states and 104565 transitions. [2025-01-09 14:48:23,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-01-09 14:48:23,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:23,923 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:48:23,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:48:23,924 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:23,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:23,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1781568266, now seen corresponding path program 1 times [2025-01-09 14:48:23,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:23,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079685945] [2025-01-09 14:48:23,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:23,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:23,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-01-09 14:48:24,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-01-09 14:48:24,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:24,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:24,508 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-01-09 14:48:24,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:24,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079685945] [2025-01-09 14:48:24,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079685945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:24,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:24,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:48:24,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148916531] [2025-01-09 14:48:24,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:24,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:48:24,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:24,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:48:24,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:48:24,512 INFO L87 Difference]: Start difference. First operand 62664 states and 104565 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:48:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:27,014 INFO L93 Difference]: Finished difference Result 132962 states and 219626 transitions. [2025-01-09 14:48:27,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:48:27,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 571 [2025-01-09 14:48:27,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:27,188 INFO L225 Difference]: With dead ends: 132962 [2025-01-09 14:48:27,188 INFO L226 Difference]: Without dead ends: 77716 [2025-01-09 14:48:27,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:48:27,246 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 893 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 2297 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:27,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 2297 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:48:27,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77716 states. [2025-01-09 14:48:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77716 to 53182. [2025-01-09 14:48:29,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53182 states, 49069 states have (on average 1.6375512034074466) internal successors, (80353), 49129 states have internal predecessors, (80353), 3907 states have call successors, (3907), 205 states have call predecessors, (3907), 205 states have return successors, (3907), 3847 states have call predecessors, (3907), 3907 states have call successors, (3907) [2025-01-09 14:48:29,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53182 states to 53182 states and 88167 transitions. [2025-01-09 14:48:29,775 INFO L78 Accepts]: Start accepts. Automaton has 53182 states and 88167 transitions. Word has length 571 [2025-01-09 14:48:29,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:29,776 INFO L471 AbstractCegarLoop]: Abstraction has 53182 states and 88167 transitions. [2025-01-09 14:48:29,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:48:29,776 INFO L276 IsEmpty]: Start isEmpty. Operand 53182 states and 88167 transitions. [2025-01-09 14:48:29,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-01-09 14:48:29,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:29,802 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:48:29,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:48:29,803 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:29,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:29,803 INFO L85 PathProgramCache]: Analyzing trace with hash 397472302, now seen corresponding path program 1 times [2025-01-09 14:48:29,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:29,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585610992] [2025-01-09 14:48:29,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:29,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:29,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-01-09 14:48:30,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-01-09 14:48:30,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:30,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 78 proven. 180 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-01-09 14:48:31,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:31,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585610992] [2025-01-09 14:48:31,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585610992] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:48:31,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780441980] [2025-01-09 14:48:31,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:31,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:31,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:31,457 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:48:31,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:48:31,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-01-09 14:48:31,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-01-09 14:48:31,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:31,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:31,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 1332 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 14:48:31,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:48:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 6378 proven. 180 refuted. 0 times theorem prover too weak. 8406 trivial. 0 not checked. [2025-01-09 14:48:32,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:48:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 78 proven. 180 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-01-09 14:48:32,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780441980] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:48:32,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:48:32,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-01-09 14:48:32,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235163640] [2025-01-09 14:48:32,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:48:32,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 14:48:32,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:32,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 14:48:32,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:48:32,747 INFO L87 Difference]: Start difference. First operand 53182 states and 88167 transitions. Second operand has 14 states, 14 states have (on average 18.0) internal successors, (252), 14 states have internal predecessors, (252), 3 states have call successors, (207), 2 states have call predecessors, (207), 4 states have return successors, (208), 3 states have call predecessors, (208), 3 states have call successors, (208) [2025-01-09 14:48:35,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:36,000 INFO L93 Difference]: Finished difference Result 133681 states and 219817 transitions. [2025-01-09 14:48:36,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 14:48:36,000 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.0) internal successors, (252), 14 states have internal predecessors, (252), 3 states have call successors, (207), 2 states have call predecessors, (207), 4 states have return successors, (208), 3 states have call predecessors, (208), 3 states have call successors, (208) Word has length 571 [2025-01-09 14:48:36,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:36,189 INFO L225 Difference]: With dead ends: 133681 [2025-01-09 14:48:36,190 INFO L226 Difference]: Without dead ends: 97009 [2025-01-09 14:48:36,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1162 GetRequests, 1137 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2025-01-09 14:48:36,264 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 1139 mSDsluCounter, 2576 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 3268 SdHoareTripleChecker+Invalid, 2090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:36,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 3268 Invalid, 2090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:48:36,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97009 states. [2025-01-09 14:48:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97009 to 61173. [2025-01-09 14:48:39,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61173 states, 55399 states have (on average 1.6113648260798932) internal successors, (89268), 55519 states have internal predecessors, (89268), 5407 states have call successors, (5407), 366 states have call predecessors, (5407), 366 states have return successors, (5407), 5287 states have call predecessors, (5407), 5407 states have call successors, (5407) [2025-01-09 14:48:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61173 states to 61173 states and 100082 transitions. [2025-01-09 14:48:39,296 INFO L78 Accepts]: Start accepts. Automaton has 61173 states and 100082 transitions. Word has length 571 [2025-01-09 14:48:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:39,296 INFO L471 AbstractCegarLoop]: Abstraction has 61173 states and 100082 transitions. [2025-01-09 14:48:39,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.0) internal successors, (252), 14 states have internal predecessors, (252), 3 states have call successors, (207), 2 states have call predecessors, (207), 4 states have return successors, (208), 3 states have call predecessors, (208), 3 states have call successors, (208) [2025-01-09 14:48:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 61173 states and 100082 transitions. [2025-01-09 14:48:39,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-01-09 14:48:39,323 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:39,324 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:48:39,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:48:39,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:39,524 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:39,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:39,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1596672404, now seen corresponding path program 1 times [2025-01-09 14:48:39,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:39,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449385896] [2025-01-09 14:48:39,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:39,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:39,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-01-09 14:48:40,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-01-09 14:48:40,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:40,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 114 proven. 144 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-01-09 14:48:40,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:40,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449385896] [2025-01-09 14:48:40,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449385896] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:48:40,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102966162] [2025-01-09 14:48:40,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:40,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:40,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:40,999 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:48:41,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:48:41,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-01-09 14:48:41,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-01-09 14:48:41,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:41,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:41,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:48:41,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:48:41,560 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 7512 proven. 117 refuted. 0 times theorem prover too weak. 7335 trivial. 0 not checked. [2025-01-09 14:48:41,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:48:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 141 proven. 117 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-01-09 14:48:41,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102966162] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:48:41,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:48:41,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 14:48:41,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749110705] [2025-01-09 14:48:41,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:48:41,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:48:41,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:41,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:48:41,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:48:41,853 INFO L87 Difference]: Start difference. First operand 61173 states and 100082 transitions. Second operand has 8 states, 8 states have (on average 29.0) internal successors, (232), 8 states have internal predecessors, (232), 3 states have call successors, (174), 2 states have call predecessors, (174), 4 states have return successors, (176), 3 states have call predecessors, (176), 3 states have call successors, (176) [2025-01-09 14:48:43,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:43,173 INFO L93 Difference]: Finished difference Result 75067 states and 122103 transitions. [2025-01-09 14:48:43,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:48:43,173 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.0) internal successors, (232), 8 states have internal predecessors, (232), 3 states have call successors, (174), 2 states have call predecessors, (174), 4 states have return successors, (176), 3 states have call predecessors, (176), 3 states have call successors, (176) Word has length 571 [2025-01-09 14:48:43,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:43,240 INFO L225 Difference]: With dead ends: 75067 [2025-01-09 14:48:43,241 INFO L226 Difference]: Without dead ends: 15574 [2025-01-09 14:48:43,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1155 GetRequests, 1139 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:48:43,298 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 716 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:43,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 873 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:48:43,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15574 states. [2025-01-09 14:48:43,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15574 to 11757. [2025-01-09 14:48:43,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11757 states, 10005 states have (on average 1.5324337831084458) internal successors, (15332), 10029 states have internal predecessors, (15332), 1615 states have call successors, (1615), 136 states have call predecessors, (1615), 136 states have return successors, (1615), 1591 states have call predecessors, (1615), 1615 states have call successors, (1615) [2025-01-09 14:48:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11757 states to 11757 states and 18562 transitions. [2025-01-09 14:48:44,002 INFO L78 Accepts]: Start accepts. Automaton has 11757 states and 18562 transitions. Word has length 571 [2025-01-09 14:48:44,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:44,003 INFO L471 AbstractCegarLoop]: Abstraction has 11757 states and 18562 transitions. [2025-01-09 14:48:44,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.0) internal successors, (232), 8 states have internal predecessors, (232), 3 states have call successors, (174), 2 states have call predecessors, (174), 4 states have return successors, (176), 3 states have call predecessors, (176), 3 states have call successors, (176) [2025-01-09 14:48:44,003 INFO L276 IsEmpty]: Start isEmpty. Operand 11757 states and 18562 transitions. [2025-01-09 14:48:44,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-01-09 14:48:44,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:44,009 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:48:44,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 14:48:44,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 14:48:44,209 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:44,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:44,210 INFO L85 PathProgramCache]: Analyzing trace with hash 691965031, now seen corresponding path program 1 times [2025-01-09 14:48:44,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:44,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070033827] [2025-01-09 14:48:44,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:44,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:44,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-01-09 14:48:44,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-01-09 14:48:44,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:44,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:45,224 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-01-09 14:48:45,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:45,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070033827] [2025-01-09 14:48:45,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070033827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:45,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:45,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:48:45,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788444516] [2025-01-09 14:48:45,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:45,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:48:45,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:45,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:48:45,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:48:45,226 INFO L87 Difference]: Start difference. First operand 11757 states and 18562 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:48:46,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:46,310 INFO L93 Difference]: Finished difference Result 30516 states and 48228 transitions. [2025-01-09 14:48:46,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:48:46,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 573 [2025-01-09 14:48:46,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:46,390 INFO L225 Difference]: With dead ends: 30516 [2025-01-09 14:48:46,390 INFO L226 Difference]: Without dead ends: 20710 [2025-01-09 14:48:46,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:48:46,412 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 755 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:46,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1673 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:48:46,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20710 states. [2025-01-09 14:48:47,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20710 to 18968. [2025-01-09 14:48:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18968 states, 16543 states have (on average 1.5407725321888412) internal successors, (25489), 16595 states have internal predecessors, (25489), 2231 states have call successors, (2231), 193 states have call predecessors, (2231), 193 states have return successors, (2231), 2179 states have call predecessors, (2231), 2231 states have call successors, (2231) [2025-01-09 14:48:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18968 states to 18968 states and 29951 transitions. [2025-01-09 14:48:47,336 INFO L78 Accepts]: Start accepts. Automaton has 18968 states and 29951 transitions. Word has length 573 [2025-01-09 14:48:47,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:47,336 INFO L471 AbstractCegarLoop]: Abstraction has 18968 states and 29951 transitions. [2025-01-09 14:48:47,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 14:48:47,336 INFO L276 IsEmpty]: Start isEmpty. Operand 18968 states and 29951 transitions. [2025-01-09 14:48:47,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-01-09 14:48:47,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:47,342 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:48:47,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 14:48:47,342 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:47,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:47,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1996121556, now seen corresponding path program 1 times [2025-01-09 14:48:47,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:47,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624933755] [2025-01-09 14:48:47,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:47,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:47,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-01-09 14:48:48,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-01-09 14:48:48,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:48,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:48,641 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 36 proven. 222 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-01-09 14:48:48,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:48,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624933755] [2025-01-09 14:48:48,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624933755] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:48:48,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429961632] [2025-01-09 14:48:48,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:48,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:48,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:48,643 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:48:48,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:48:48,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-01-09 14:48:48,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-01-09 14:48:48,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:48,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:48,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 14:48:48,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:48:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 3786 proven. 36 refuted. 0 times theorem prover too weak. 11142 trivial. 0 not checked. [2025-01-09 14:48:49,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:48:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 222 proven. 36 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-01-09 14:48:49,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429961632] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:48:49,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:48:49,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2025-01-09 14:48:49,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673132206] [2025-01-09 14:48:49,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:48:49,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 14:48:49,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:49,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 14:48:49,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:48:49,947 INFO L87 Difference]: Start difference. First operand 18968 states and 29951 transitions. Second operand has 18 states, 18 states have (on average 19.444444444444443) internal successors, (350), 18 states have internal predecessors, (350), 6 states have call successors, (248), 3 states have call predecessors, (248), 6 states have return successors, (249), 6 states have call predecessors, (249), 6 states have call successors, (249) [2025-01-09 14:48:52,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:52,295 INFO L93 Difference]: Finished difference Result 36624 states and 57500 transitions. [2025-01-09 14:48:52,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 14:48:52,296 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 19.444444444444443) internal successors, (350), 18 states have internal predecessors, (350), 6 states have call successors, (248), 3 states have call predecessors, (248), 6 states have return successors, (249), 6 states have call predecessors, (249), 6 states have call successors, (249) Word has length 574 [2025-01-09 14:48:52,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:52,353 INFO L225 Difference]: With dead ends: 36624 [2025-01-09 14:48:52,353 INFO L226 Difference]: Without dead ends: 19428 [2025-01-09 14:48:52,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1168 GetRequests, 1136 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=298, Invalid=758, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 14:48:52,383 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 784 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 2230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:52,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 1714 Invalid, 2230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 1760 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 14:48:52,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19428 states. [2025-01-09 14:48:53,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19428 to 10976. [2025-01-09 14:48:53,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10976 states, 9629 states have (on average 1.5166683975490705) internal successors, (14604), 9657 states have internal predecessors, (14604), 1203 states have call successors, (1203), 143 states have call predecessors, (1203), 143 states have return successors, (1203), 1175 states have call predecessors, (1203), 1203 states have call successors, (1203) [2025-01-09 14:48:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10976 states to 10976 states and 17010 transitions. [2025-01-09 14:48:53,170 INFO L78 Accepts]: Start accepts. Automaton has 10976 states and 17010 transitions. Word has length 574 [2025-01-09 14:48:53,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:53,171 INFO L471 AbstractCegarLoop]: Abstraction has 10976 states and 17010 transitions. [2025-01-09 14:48:53,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 19.444444444444443) internal successors, (350), 18 states have internal predecessors, (350), 6 states have call successors, (248), 3 states have call predecessors, (248), 6 states have return successors, (249), 6 states have call predecessors, (249), 6 states have call successors, (249) [2025-01-09 14:48:53,171 INFO L276 IsEmpty]: Start isEmpty. Operand 10976 states and 17010 transitions. [2025-01-09 14:48:53,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-01-09 14:48:53,175 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:53,175 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:48:53,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 14:48:53,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 14:48:53,376 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:53,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:53,376 INFO L85 PathProgramCache]: Analyzing trace with hash 868759848, now seen corresponding path program 1 times [2025-01-09 14:48:53,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:53,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915603114] [2025-01-09 14:48:53,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:53,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:53,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes.