./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-27.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 cde063dcb13ed313b2f32e49cd3dc75da2c365cf6b52ae59dd9b17042beff0a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:09:00,817 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:09:00,873 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:09:00,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:09:00,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:09:00,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:09:00,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:09:00,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:09:00,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:09:00,903 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:09:00,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:09:00,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:09:00,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:09:00,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:09:00,905 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:09:00,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:09:00,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:09:00,905 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:09:00,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:09:00,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:09:00,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:09:00,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:09:00,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:09:00,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:09:00,906 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:09:00,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:09:00,906 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:09:00,906 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:09:00,906 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:09:00,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:09:00,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:09:00,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:09:00,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:09:00,907 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:09:00,907 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:09:00,907 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:09:00,907 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:09:00,907 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:09:00,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:09:00,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:09:00,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:09:00,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:09:00,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:09:00,908 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/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 -> cde063dcb13ed313b2f32e49cd3dc75da2c365cf6b52ae59dd9b17042beff0a8 [2025-03-04 00:09:01,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:09:01,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:09:01,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:09:01,179 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:09:01,179 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:09:01,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-27.i [2025-03-04 00:09:02,372 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660cffc42/cc5c4d8cc68c4ddbada64cb5a72b60f1/FLAGaa554e5b2 [2025-03-04 00:09:02,698 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:09:02,699 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-27.i [2025-03-04 00:09:02,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660cffc42/cc5c4d8cc68c4ddbada64cb5a72b60f1/FLAGaa554e5b2 [2025-03-04 00:09:02,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660cffc42/cc5c4d8cc68c4ddbada64cb5a72b60f1 [2025-03-04 00:09:02,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:09:02,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:09:02,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:09:02,736 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:09:02,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:09:02,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:09:02" (1/1) ... [2025-03-04 00:09:02,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20e2ed5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:02, skipping insertion in model container [2025-03-04 00:09:02,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:09:02" (1/1) ... [2025-03-04 00:09:02,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:09:02,892 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-27.i[916,929] [2025-03-04 00:09:03,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:09:03,071 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:09:03,083 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-27.i[916,929] [2025-03-04 00:09:03,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:09:03,194 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:09:03,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:03 WrapperNode [2025-03-04 00:09:03,196 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:09:03,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:09:03,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:09:03,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:09:03,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:03" (1/1) ... [2025-03-04 00:09:03,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:03" (1/1) ... [2025-03-04 00:09:03,264 INFO L138 Inliner]: procedures = 26, calls = 64, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 450 [2025-03-04 00:09:03,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:09:03,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:09:03,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:09:03,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:09:03,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:03" (1/1) ... [2025-03-04 00:09:03,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:03" (1/1) ... [2025-03-04 00:09:03,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:03" (1/1) ... [2025-03-04 00:09:03,303 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-03-04 00:09:03,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:03" (1/1) ... [2025-03-04 00:09:03,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:03" (1/1) ... [2025-03-04 00:09:03,320 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:03" (1/1) ... [2025-03-04 00:09:03,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:03" (1/1) ... [2025-03-04 00:09:03,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:03" (1/1) ... [2025-03-04 00:09:03,332 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:03" (1/1) ... [2025-03-04 00:09:03,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:09:03,341 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:09:03,341 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:09:03,341 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:09:03,342 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:03" (1/1) ... [2025-03-04 00:09:03,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:09:03,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:03,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:09:03,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:09:03,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:09:03,395 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:09:03,395 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:09:03,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:09:03,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:09:03,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:09:03,479 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:09:03,480 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:09:04,114 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L374: havoc property_#t~ite38#1;havoc property_#t~bitwise37#1;havoc property_#t~short39#1;havoc property_#t~bitwise40#1;havoc property_#t~short41#1;havoc property_#t~bitwise42#1;havoc property_#t~short43#1; [2025-03-04 00:09:04,179 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-03-04 00:09:04,180 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:09:04,197 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:09:04,197 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:09:04,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:09:04 BoogieIcfgContainer [2025-03-04 00:09:04,198 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:09:04,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:09:04,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:09:04,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:09:04,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:09:02" (1/3) ... [2025-03-04 00:09:04,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372fbfa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:09:04, skipping insertion in model container [2025-03-04 00:09:04,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:03" (2/3) ... [2025-03-04 00:09:04,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372fbfa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:09:04, skipping insertion in model container [2025-03-04 00:09:04,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:09:04" (3/3) ... [2025-03-04 00:09:04,211 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-27.i [2025-03-04 00:09:04,223 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:09:04,225 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-27.i that has 2 procedures, 189 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:09:04,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:09:04,281 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;@32507f6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:09:04,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:09:04,286 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 135 states have (on average 1.4962962962962962) internal successors, (202), 136 states have internal predecessors, (202), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 00:09:04,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-04 00:09:04,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:04,308 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 00:09:04,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:04,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:04,314 INFO L85 PathProgramCache]: Analyzing trace with hash 574031725, now seen corresponding path program 1 times [2025-03-04 00:09:04,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:04,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440228655] [2025-03-04 00:09:04,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:04,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:04,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-04 00:09:04,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-04 00:09:04,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:04,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:04,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-03-04 00:09:04,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:04,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440228655] [2025-03-04 00:09:04,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440228655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:04,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642848303] [2025-03-04 00:09:04,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:04,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:04,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:04,756 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:09:04,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:09:04,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-04 00:09:05,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-04 00:09:05,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:05,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:05,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:09:05,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-03-04 00:09:05,080 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:09:05,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642848303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:05,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:09:05,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:09:05,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050978885] [2025-03-04 00:09:05,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:05,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:09:05,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:05,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:09:05,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:09:05,104 INFO L87 Difference]: Start difference. First operand has 189 states, 135 states have (on average 1.4962962962962962) internal successors, (202), 136 states have internal predecessors, (202), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-04 00:09:05,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:05,148 INFO L93 Difference]: Finished difference Result 371 states and 652 transitions. [2025-03-04 00:09:05,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:09:05,150 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) Word has length 340 [2025-03-04 00:09:05,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:05,156 INFO L225 Difference]: With dead ends: 371 [2025-03-04 00:09:05,156 INFO L226 Difference]: Without dead ends: 185 [2025-03-04 00:09:05,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 341 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-03-04 00:09:05,161 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 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-03-04 00:09:05,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:09:05,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-04 00:09:05,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-03-04 00:09:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 132 states have (on average 1.4621212121212122) internal successors, (193), 132 states have internal predecessors, (193), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 00:09:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 295 transitions. [2025-03-04 00:09:05,202 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 295 transitions. Word has length 340 [2025-03-04 00:09:05,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:05,204 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 295 transitions. [2025-03-04 00:09:05,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-04 00:09:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 295 transitions. [2025-03-04 00:09:05,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-04 00:09:05,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:05,212 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 00:09:05,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:09:05,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:09:05,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:05,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:05,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1962631599, now seen corresponding path program 1 times [2025-03-04 00:09:05,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:05,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591920549] [2025-03-04 00:09:05,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:05,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:05,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-04 00:09:05,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-04 00:09:05,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:05,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:05,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-04 00:09:05,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:05,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591920549] [2025-03-04 00:09:05,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591920549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:05,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:05,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:09:05,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151030519] [2025-03-04 00:09:05,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:05,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:09:05,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:05,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:09:05,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:09:05,818 INFO L87 Difference]: Start difference. First operand 185 states and 295 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:09:05,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:05,896 INFO L93 Difference]: Finished difference Result 461 states and 740 transitions. [2025-03-04 00:09:05,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:09:05,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 341 [2025-03-04 00:09:05,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:05,905 INFO L225 Difference]: With dead ends: 461 [2025-03-04 00:09:05,905 INFO L226 Difference]: Without dead ends: 279 [2025-03-04 00:09:05,906 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-03-04 00:09:05,907 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 151 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:05,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 565 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:09:05,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-04 00:09:05,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 189. [2025-03-04 00:09:05,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 136 states have (on average 1.463235294117647) internal successors, (199), 136 states have internal predecessors, (199), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 00:09:05,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 301 transitions. [2025-03-04 00:09:05,930 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 301 transitions. Word has length 341 [2025-03-04 00:09:05,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:05,932 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 301 transitions. [2025-03-04 00:09:05,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:09:05,933 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 301 transitions. [2025-03-04 00:09:05,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-04 00:09:05,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:05,938 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 00:09:05,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:09:05,938 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:05,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:05,939 INFO L85 PathProgramCache]: Analyzing trace with hash -8307858, now seen corresponding path program 1 times [2025-03-04 00:09:05,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:05,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243350904] [2025-03-04 00:09:05,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:05,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:05,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-04 00:09:06,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-04 00:09:06,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:06,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:06,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-04 00:09:06,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:06,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243350904] [2025-03-04 00:09:06,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243350904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:06,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:06,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:09:06,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154729596] [2025-03-04 00:09:06,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:06,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:09:06,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:06,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:09:06,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:09:06,799 INFO L87 Difference]: Start difference. First operand 189 states and 301 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:09:07,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:07,492 INFO L93 Difference]: Finished difference Result 733 states and 1167 transitions. [2025-03-04 00:09:07,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:09:07,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 341 [2025-03-04 00:09:07,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:07,497 INFO L225 Difference]: With dead ends: 733 [2025-03-04 00:09:07,497 INFO L226 Difference]: Without dead ends: 547 [2025-03-04 00:09:07,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:09:07,499 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 519 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:07,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 1384 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:09:07,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-04 00:09:07,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 405. [2025-03-04 00:09:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 300 states have (on average 1.4633333333333334) internal successors, (439), 300 states have internal predecessors, (439), 102 states have call successors, (102), 2 states have call predecessors, (102), 2 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-04 00:09:07,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 643 transitions. [2025-03-04 00:09:07,544 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 643 transitions. Word has length 341 [2025-03-04 00:09:07,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:07,545 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 643 transitions. [2025-03-04 00:09:07,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:09:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 643 transitions. [2025-03-04 00:09:07,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-04 00:09:07,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:07,548 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 00:09:07,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:09:07,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:07,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:07,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1624496141, now seen corresponding path program 1 times [2025-03-04 00:09:07,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:07,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134152860] [2025-03-04 00:09:07,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:07,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:07,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-04 00:09:07,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-04 00:09:07,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:07,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-04 00:09:08,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:08,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134152860] [2025-03-04 00:09:08,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134152860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:08,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:08,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:09:08,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979672693] [2025-03-04 00:09:08,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:08,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:09:08,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:08,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:09:08,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:09:08,454 INFO L87 Difference]: Start difference. First operand 405 states and 643 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:09:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:08,960 INFO L93 Difference]: Finished difference Result 1315 states and 2084 transitions. [2025-03-04 00:09:08,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:09:08,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 341 [2025-03-04 00:09:08,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:08,969 INFO L225 Difference]: With dead ends: 1315 [2025-03-04 00:09:08,970 INFO L226 Difference]: Without dead ends: 913 [2025-03-04 00:09:08,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:09:08,973 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 414 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:08,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1057 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:09:08,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2025-03-04 00:09:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 750. [2025-03-04 00:09:09,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 583 states have (on average 1.490566037735849) internal successors, (869), 585 states have internal predecessors, (869), 162 states have call successors, (162), 4 states have call predecessors, (162), 4 states have return successors, (162), 160 states have call predecessors, (162), 162 states have call successors, (162) [2025-03-04 00:09:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1193 transitions. [2025-03-04 00:09:09,086 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1193 transitions. Word has length 341 [2025-03-04 00:09:09,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:09,090 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1193 transitions. [2025-03-04 00:09:09,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:09:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1193 transitions. [2025-03-04 00:09:09,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-04 00:09:09,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:09,095 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 00:09:09,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:09:09,095 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:09,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:09,095 INFO L85 PathProgramCache]: Analyzing trace with hash -739373936, now seen corresponding path program 1 times [2025-03-04 00:09:09,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:09,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762647590] [2025-03-04 00:09:09,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:09,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:09,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-04 00:09:09,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-04 00:09:09,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:09,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-04 00:09:10,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:10,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762647590] [2025-03-04 00:09:10,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762647590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:10,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:10,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:09:10,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065203690] [2025-03-04 00:09:10,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:10,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:09:10,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:10,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:09:10,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:09:10,230 INFO L87 Difference]: Start difference. First operand 750 states and 1193 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:09:10,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:10,450 INFO L93 Difference]: Finished difference Result 1456 states and 2315 transitions. [2025-03-04 00:09:10,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:09:10,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 342 [2025-03-04 00:09:10,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:10,455 INFO L225 Difference]: With dead ends: 1456 [2025-03-04 00:09:10,455 INFO L226 Difference]: Without dead ends: 709 [2025-03-04 00:09:10,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:09:10,458 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 237 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:10,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 779 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:09:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-03-04 00:09:10,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 684. [2025-03-04 00:09:10,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 517 states have (on average 1.4738878143133463) internal successors, (762), 519 states have internal predecessors, (762), 162 states have call successors, (162), 4 states have call predecessors, (162), 4 states have return successors, (162), 160 states have call predecessors, (162), 162 states have call successors, (162) [2025-03-04 00:09:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1086 transitions. [2025-03-04 00:09:10,531 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1086 transitions. Word has length 342 [2025-03-04 00:09:10,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:10,531 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1086 transitions. [2025-03-04 00:09:10,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:09:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1086 transitions. [2025-03-04 00:09:10,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-04 00:09:10,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:10,538 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 00:09:10,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:09:10,539 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:10,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1662057519, now seen corresponding path program 1 times [2025-03-04 00:09:10,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:10,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321192824] [2025-03-04 00:09:10,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:10,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:10,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-04 00:09:10,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-04 00:09:10,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:10,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-04 00:09:11,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:11,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321192824] [2025-03-04 00:09:11,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321192824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:11,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:11,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:09:11,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675226503] [2025-03-04 00:09:11,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:11,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:09:11,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:11,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:09:11,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:09:11,206 INFO L87 Difference]: Start difference. First operand 684 states and 1086 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:09:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:11,744 INFO L93 Difference]: Finished difference Result 1790 states and 2825 transitions. [2025-03-04 00:09:11,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:09:11,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 342 [2025-03-04 00:09:11,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:11,753 INFO L225 Difference]: With dead ends: 1790 [2025-03-04 00:09:11,754 INFO L226 Difference]: Without dead ends: 1109 [2025-03-04 00:09:11,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:09:11,758 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 465 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:11,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 746 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:09:11,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2025-03-04 00:09:11,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 735. [2025-03-04 00:09:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 566 states have (on average 1.4505300353356891) internal successors, (821), 568 states have internal predecessors, (821), 162 states have call successors, (162), 6 states have call predecessors, (162), 6 states have return successors, (162), 160 states have call predecessors, (162), 162 states have call successors, (162) [2025-03-04 00:09:11,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1145 transitions. [2025-03-04 00:09:11,846 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1145 transitions. Word has length 342 [2025-03-04 00:09:11,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:11,846 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1145 transitions. [2025-03-04 00:09:11,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:09:11,847 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1145 transitions. [2025-03-04 00:09:11,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-04 00:09:11,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:11,850 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 00:09:11,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:09:11,851 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:11,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:11,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2075439121, now seen corresponding path program 1 times [2025-03-04 00:09:11,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:11,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856949951] [2025-03-04 00:09:11,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:11,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:11,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-04 00:09:12,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-04 00:09:12,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:12,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:14,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 111 proven. 183 refuted. 0 times theorem prover too weak. 4806 trivial. 0 not checked. [2025-03-04 00:09:14,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:14,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856949951] [2025-03-04 00:09:14,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856949951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:14,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982740480] [2025-03-04 00:09:14,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:14,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:14,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:14,777 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:09:14,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:09:14,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-04 00:09:14,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-04 00:09:14,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:14,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:14,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 00:09:14,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 3155 proven. 192 refuted. 0 times theorem prover too weak. 1753 trivial. 0 not checked. [2025-03-04 00:09:15,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:09:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 102 proven. 195 refuted. 0 times theorem prover too weak. 4803 trivial. 0 not checked. [2025-03-04 00:09:16,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982740480] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:09:16,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:09:16,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 9] total 28 [2025-03-04 00:09:16,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779225929] [2025-03-04 00:09:16,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:09:16,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 00:09:16,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:16,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 00:09:16,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2025-03-04 00:09:16,364 INFO L87 Difference]: Start difference. First operand 735 states and 1145 transitions. Second operand has 28 states, 27 states have (on average 8.88888888888889) internal successors, (240), 28 states have internal predecessors, (240), 11 states have call successors, (143), 3 states have call predecessors, (143), 7 states have return successors, (144), 10 states have call predecessors, (144), 11 states have call successors, (144) [2025-03-04 00:09:18,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:18,293 INFO L93 Difference]: Finished difference Result 3239 states and 4971 transitions. [2025-03-04 00:09:18,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 00:09:18,294 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 8.88888888888889) internal successors, (240), 28 states have internal predecessors, (240), 11 states have call successors, (143), 3 states have call predecessors, (143), 7 states have return successors, (144), 10 states have call predecessors, (144), 11 states have call successors, (144) Word has length 343 [2025-03-04 00:09:18,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:18,307 INFO L225 Difference]: With dead ends: 3239 [2025-03-04 00:09:18,308 INFO L226 Difference]: Without dead ends: 2507 [2025-03-04 00:09:18,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 737 GetRequests, 684 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=714, Invalid=2148, Unknown=0, NotChecked=0, Total=2862 [2025-03-04 00:09:18,312 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 3926 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3936 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:18,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3936 Valid, 1565 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 00:09:18,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2025-03-04 00:09:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 1237. [2025-03-04 00:09:18,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1024 states have (on average 1.451171875) internal successors, (1486), 1030 states have internal predecessors, (1486), 194 states have call successors, (194), 18 states have call predecessors, (194), 18 states have return successors, (194), 188 states have call predecessors, (194), 194 states have call successors, (194) [2025-03-04 00:09:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1874 transitions. [2025-03-04 00:09:18,401 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1874 transitions. Word has length 343 [2025-03-04 00:09:18,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:18,402 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1874 transitions. [2025-03-04 00:09:18,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 8.88888888888889) internal successors, (240), 28 states have internal predecessors, (240), 11 states have call successors, (143), 3 states have call predecessors, (143), 7 states have return successors, (144), 10 states have call predecessors, (144), 11 states have call successors, (144) [2025-03-04 00:09:18,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1874 transitions. [2025-03-04 00:09:18,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-04 00:09:18,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:18,407 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 00:09:18,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:09:18,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 00:09:18,608 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:18,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:18,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2100966777, now seen corresponding path program 1 times [2025-03-04 00:09:18,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:18,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407428340] [2025-03-04 00:09:18,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:18,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:18,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-04 00:09:18,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-04 00:09:18,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:18,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:25,988 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 111 proven. 183 refuted. 0 times theorem prover too weak. 4806 trivial. 0 not checked. [2025-03-04 00:09:25,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:25,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407428340] [2025-03-04 00:09:25,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407428340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:25,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578747231] [2025-03-04 00:09:25,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:25,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:25,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:25,991 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:09:26,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:09:26,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-04 00:09:26,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-04 00:09:26,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:26,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:26,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 00:09:26,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 3212 proven. 300 refuted. 0 times theorem prover too weak. 1588 trivial. 0 not checked. [2025-03-04 00:09:27,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:09:29,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 111 proven. 186 refuted. 0 times theorem prover too weak. 4803 trivial. 0 not checked. [2025-03-04 00:09:29,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578747231] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:09:29,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:09:29,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 51 [2025-03-04 00:09:29,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247426558] [2025-03-04 00:09:29,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:09:29,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-04 00:09:29,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:29,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-04 00:09:29,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=2259, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 00:09:29,714 INFO L87 Difference]: Start difference. First operand 1237 states and 1874 transitions. Second operand has 51 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 12 states have call successors, (153), 5 states have call predecessors, (153), 11 states have return successors, (153), 11 states have call predecessors, (153), 12 states have call successors, (153) [2025-03-04 00:10:06,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:06,941 INFO L93 Difference]: Finished difference Result 26737 states and 39692 transitions. [2025-03-04 00:10:06,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 327 states. [2025-03-04 00:10:06,942 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 12 states have call successors, (153), 5 states have call predecessors, (153), 11 states have return successors, (153), 11 states have call predecessors, (153), 12 states have call successors, (153) Word has length 345 [2025-03-04 00:10:06,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:07,045 INFO L225 Difference]: With dead ends: 26737 [2025-03-04 00:10:07,045 INFO L226 Difference]: Without dead ends: 25339 [2025-03-04 00:10:07,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1122 GetRequests, 753 SyntacticMatches, 1 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55614 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=20528, Invalid=116002, Unknown=0, NotChecked=0, Total=136530 [2025-03-04 00:10:07,075 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 14498 mSDsluCounter, 12630 mSDsCounter, 0 mSdLazyCounter, 16600 mSolverCounterSat, 3387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14515 SdHoareTripleChecker+Valid, 13236 SdHoareTripleChecker+Invalid, 19987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3387 IncrementalHoareTripleChecker+Valid, 16600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:07,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14515 Valid, 13236 Invalid, 19987 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3387 Valid, 16600 Invalid, 0 Unknown, 0 Unchecked, 13.5s Time] [2025-03-04 00:10:07,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25339 states. [2025-03-04 00:10:08,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25339 to 9311. [2025-03-04 00:10:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9311 states, 7754 states have (on average 1.4502192416817126) internal successors, (11245), 7774 states have internal predecessors, (11245), 1328 states have call successors, (1328), 228 states have call predecessors, (1328), 228 states have return successors, (1328), 1308 states have call predecessors, (1328), 1328 states have call successors, (1328) [2025-03-04 00:10:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9311 states to 9311 states and 13901 transitions. [2025-03-04 00:10:08,191 INFO L78 Accepts]: Start accepts. Automaton has 9311 states and 13901 transitions. Word has length 345 [2025-03-04 00:10:08,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:08,192 INFO L471 AbstractCegarLoop]: Abstraction has 9311 states and 13901 transitions. [2025-03-04 00:10:08,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 12 states have call successors, (153), 5 states have call predecessors, (153), 11 states have return successors, (153), 11 states have call predecessors, (153), 12 states have call successors, (153) [2025-03-04 00:10:08,193 INFO L276 IsEmpty]: Start isEmpty. Operand 9311 states and 13901 transitions. [2025-03-04 00:10:08,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-04 00:10:08,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:08,200 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 00:10:08,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:10:08,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:08,402 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:08,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:08,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2112282904, now seen corresponding path program 1 times [2025-03-04 00:10:08,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:08,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987544345] [2025-03-04 00:10:08,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:08,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:08,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-04 00:10:08,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-04 00:10:08,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:08,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:10,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 108 proven. 42 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2025-03-04 00:10:10,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:10,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987544345] [2025-03-04 00:10:10,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987544345] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:10,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136759087] [2025-03-04 00:10:10,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:10,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:10,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:10,379 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:10:10,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:10:10,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-04 00:10:10,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-04 00:10:10,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:10,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:10,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 00:10:10,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:12,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 3426 proven. 171 refuted. 0 times theorem prover too weak. 1503 trivial. 0 not checked. [2025-03-04 00:10:12,225 INFO L312 TraceCheckSpWp]: Computing backward predicates...