./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-13.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0774421f7ba176c3cd99ed79363ce4f8b6083c8c0f33805bbcb720d76b34f63e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:25:02,802 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:25:02,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:25:02,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:25:02,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:25:02,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:25:02,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:25:02,864 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:25:02,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:25:02,864 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:25:02,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:25:02,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:25:02,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:25:02,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:25:02,865 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:25:02,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:25:02,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:25:02,865 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:25:02,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:25:02,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:25:02,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:25:02,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:25:02,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:25:02,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:25:02,866 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:25:02,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:25:02,866 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:25:02,866 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:25:02,866 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:25:02,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:25:02,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:25:02,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:25:02,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:25:02,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:25:02,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:25:02,867 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:25:02,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:25:02,867 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:25:02,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:25:02,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:25:02,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:25:02,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:25:02,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:25:02,868 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0774421f7ba176c3cd99ed79363ce4f8b6083c8c0f33805bbcb720d76b34f63e [2025-02-06 02:25:03,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:25:03,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:25:03,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:25:03,062 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:25:03,062 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:25:03,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-13.i [2025-02-06 02:25:04,254 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/70679726d/316131d3ba5e438499037849bfd4b4fe/FLAGae6e77f28 [2025-02-06 02:25:04,513 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:25:04,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-13.i [2025-02-06 02:25:04,519 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/70679726d/316131d3ba5e438499037849bfd4b4fe/FLAGae6e77f28 [2025-02-06 02:25:04,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/70679726d/316131d3ba5e438499037849bfd4b4fe [2025-02-06 02:25:04,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:25:04,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:25:04,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:25:04,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:25:04,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:25:04,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:25:04" (1/1) ... [2025-02-06 02:25:04,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6840bf50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:04, skipping insertion in model container [2025-02-06 02:25:04,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:25:04" (1/1) ... [2025-02-06 02:25:04,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:25:04,925 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-13.i[915,928] [2025-02-06 02:25:04,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:25:04,968 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:25:04,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-13.i[915,928] [2025-02-06 02:25:04,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:25:05,012 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:25:05,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:05 WrapperNode [2025-02-06 02:25:05,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:25:05,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:25:05,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:25:05,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:25:05,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:05" (1/1) ... [2025-02-06 02:25:05,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:05" (1/1) ... [2025-02-06 02:25:05,057 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2025-02-06 02:25:05,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:25:05,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:25:05,058 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:25:05,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:25:05,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:05" (1/1) ... [2025-02-06 02:25:05,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:05" (1/1) ... [2025-02-06 02:25:05,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:05" (1/1) ... [2025-02-06 02:25:05,089 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:25:05,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:05" (1/1) ... [2025-02-06 02:25:05,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:05" (1/1) ... [2025-02-06 02:25:05,099 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:05" (1/1) ... [2025-02-06 02:25:05,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:05" (1/1) ... [2025-02-06 02:25:05,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:05" (1/1) ... [2025-02-06 02:25:05,103 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:05" (1/1) ... [2025-02-06 02:25:05,108 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:25:05,109 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:25:05,109 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:25:05,109 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:25:05,110 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:05" (1/1) ... [2025-02-06 02:25:05,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:25:05,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:25:05,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:25:05,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:25:05,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:25:05,152 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:25:05,152 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:25:05,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:25:05,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:25:05,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:25:05,198 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:25:05,199 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:25:05,396 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-06 02:25:05,396 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:25:05,403 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:25:05,403 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:25:05,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:25:05 BoogieIcfgContainer [2025-02-06 02:25:05,403 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:25:05,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:25:05,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:25:05,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:25:05,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:25:04" (1/3) ... [2025-02-06 02:25:05,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c5bff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:25:05, skipping insertion in model container [2025-02-06 02:25:05,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:05" (2/3) ... [2025-02-06 02:25:05,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c5bff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:25:05, skipping insertion in model container [2025-02-06 02:25:05,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:25:05" (3/3) ... [2025-02-06 02:25:05,410 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-13.i [2025-02-06 02:25:05,420 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:25:05,422 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-13.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:25:05,455 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:25:05,462 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;@19950b6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:25:05,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:25:05,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 02:25:05,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 02:25:05,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:25:05,472 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:25:05,473 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:25:05,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:25:05,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1744189051, now seen corresponding path program 1 times [2025-02-06 02:25:05,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:25:05,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593706374] [2025-02-06 02:25:05,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:25:05,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:25:05,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 02:25:05,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 02:25:05,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:25:05,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:25:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 02:25:05,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:25:05,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593706374] [2025-02-06 02:25:05,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593706374] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:25:05,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060161445] [2025-02-06 02:25:05,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:25:05,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:25:05,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:25:05,687 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:25:05,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:25:05,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 02:25:05,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 02:25:05,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:25:05,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:25:05,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:25:05,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:25:05,817 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 02:25:05,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:25:05,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060161445] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:25:05,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:25:05,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:25:05,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908060016] [2025-02-06 02:25:05,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:25:05,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:25:05,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:25:05,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:25:05,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:25:05,838 INFO L87 Difference]: Start difference. First operand has 46 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 02:25:05,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:25:05,853 INFO L93 Difference]: Finished difference Result 86 states and 143 transitions. [2025-02-06 02:25:05,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:25:05,855 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 101 [2025-02-06 02:25:05,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:25:05,858 INFO L225 Difference]: With dead ends: 86 [2025-02-06 02:25:05,859 INFO L226 Difference]: Without dead ends: 43 [2025-02-06 02:25:05,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:25:05,862 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:25:05,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:25:05,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-06 02:25:05,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-06 02:25:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 02:25:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2025-02-06 02:25:05,894 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 101 [2025-02-06 02:25:05,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:25:05,895 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2025-02-06 02:25:05,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 02:25:05,895 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2025-02-06 02:25:05,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 02:25:05,897 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:25:05,897 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:25:05,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:25:06,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:25:06,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:25:06,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:25:06,103 INFO L85 PathProgramCache]: Analyzing trace with hash 549242491, now seen corresponding path program 1 times [2025-02-06 02:25:06,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:25:06,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314036975] [2025-02-06 02:25:06,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:25:06,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:25:06,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 02:25:06,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 02:25:06,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:25:06,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:25:06,387 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:25:06,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:25:06,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314036975] [2025-02-06 02:25:06,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314036975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:25:06,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:25:06,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:25:06,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107697314] [2025-02-06 02:25:06,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:25:06,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:25:06,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:25:06,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:25:06,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:25:06,389 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:25:06,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:25:06,421 INFO L93 Difference]: Finished difference Result 123 states and 177 transitions. [2025-02-06 02:25:06,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:25:06,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2025-02-06 02:25:06,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:25:06,425 INFO L225 Difference]: With dead ends: 123 [2025-02-06 02:25:06,425 INFO L226 Difference]: Without dead ends: 83 [2025-02-06 02:25:06,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:25:06,428 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 28 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:25:06,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 111 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:25:06,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-06 02:25:06,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2025-02-06 02:25:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 02:25:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2025-02-06 02:25:06,447 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 101 [2025-02-06 02:25:06,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:25:06,448 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2025-02-06 02:25:06,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:25:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2025-02-06 02:25:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 02:25:06,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:25:06,450 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:25:06,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:25:06,450 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:25:06,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:25:06,454 INFO L85 PathProgramCache]: Analyzing trace with hash 577871642, now seen corresponding path program 1 times [2025-02-06 02:25:06,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:25:06,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419953750] [2025-02-06 02:25:06,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:25:06,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:25:06,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 02:25:06,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 02:25:06,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:25:06,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:25:08,353 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:25:08,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:25:08,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419953750] [2025-02-06 02:25:08,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419953750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:25:08,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:25:08,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:25:08,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445837250] [2025-02-06 02:25:08,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:25:08,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:25:08,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:25:08,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:25:08,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:25:08,357 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:25:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:25:08,587 INFO L93 Difference]: Finished difference Result 184 states and 257 transitions. [2025-02-06 02:25:08,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:25:08,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2025-02-06 02:25:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:25:08,589 INFO L225 Difference]: With dead ends: 184 [2025-02-06 02:25:08,589 INFO L226 Difference]: Without dead ends: 144 [2025-02-06 02:25:08,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:25:08,590 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 66 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:25:08,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 361 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:25:08,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-06 02:25:08,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2025-02-06 02:25:08,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 87 states have internal predecessors, (92), 50 states have call successors, (50), 6 states have call predecessors, (50), 6 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 02:25:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 192 transitions. [2025-02-06 02:25:08,617 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 192 transitions. Word has length 101 [2025-02-06 02:25:08,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:25:08,617 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 192 transitions. [2025-02-06 02:25:08,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:25:08,618 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 192 transitions. [2025-02-06 02:25:08,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 02:25:08,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:25:08,620 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:25:08,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:25:08,620 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:25:08,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:25:08,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1974285319, now seen corresponding path program 1 times [2025-02-06 02:25:08,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:25:08,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649810327] [2025-02-06 02:25:08,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:25:08,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:25:08,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 02:25:08,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 02:25:08,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:25:08,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:25:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:25:08,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:25:08,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649810327] [2025-02-06 02:25:08,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649810327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:25:08,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:25:08,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:25:08,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907487063] [2025-02-06 02:25:08,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:25:08,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:25:08,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:25:08,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:25:08,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:25:08,664 INFO L87 Difference]: Start difference. First operand 141 states and 192 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:25:08,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:25:08,690 INFO L93 Difference]: Finished difference Result 291 states and 393 transitions. [2025-02-06 02:25:08,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:25:08,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2025-02-06 02:25:08,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:25:08,693 INFO L225 Difference]: With dead ends: 291 [2025-02-06 02:25:08,693 INFO L226 Difference]: Without dead ends: 169 [2025-02-06 02:25:08,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:25:08,694 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 56 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:25:08,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 115 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:25:08,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-06 02:25:08,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 153. [2025-02-06 02:25:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 86 states have (on average 1.058139534883721) internal successors, (91), 88 states have internal predecessors, (91), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 02:25:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 207 transitions. [2025-02-06 02:25:08,729 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 207 transitions. Word has length 101 [2025-02-06 02:25:08,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:25:08,729 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 207 transitions. [2025-02-06 02:25:08,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:25:08,730 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 207 transitions. [2025-02-06 02:25:08,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 02:25:08,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:25:08,731 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:25:08,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:25:08,731 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:25:08,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:25:08,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1404549145, now seen corresponding path program 1 times [2025-02-06 02:25:08,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:25:08,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346551376] [2025-02-06 02:25:08,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:25:08,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:25:08,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 02:25:08,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 02:25:08,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:25:08,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:25:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:25:08,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:25:08,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346551376] [2025-02-06 02:25:08,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346551376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:25:08,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:25:08,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:25:08,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379702182] [2025-02-06 02:25:08,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:25:08,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:25:08,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:25:08,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:25:08,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:25:08,811 INFO L87 Difference]: Start difference. First operand 153 states and 207 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:25:08,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:25:08,827 INFO L93 Difference]: Finished difference Result 154 states and 208 transitions. [2025-02-06 02:25:08,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:25:08,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2025-02-06 02:25:08,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:25:08,828 INFO L225 Difference]: With dead ends: 154 [2025-02-06 02:25:08,828 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 02:25:08,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:25:08,829 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 52 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:25:08,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 144 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:25:08,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 02:25:08,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 02:25:08,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 02:25:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 02:25:08,830 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2025-02-06 02:25:08,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:25:08,830 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 02:25:08,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:25:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 02:25:08,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 02:25:08,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 02:25:08,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:25:08,835 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 02:25:08,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 02:25:09,293 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 02:25:09,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:25:09 BoogieIcfgContainer [2025-02-06 02:25:09,308 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 02:25:09,309 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 02:25:09,309 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 02:25:09,309 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 02:25:09,310 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:25:05" (3/4) ... [2025-02-06 02:25:09,311 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 02:25:09,315 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-06 02:25:09,319 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-02-06 02:25:09,319 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 02:25:09,319 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 02:25:09,319 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 02:25:09,389 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 02:25:09,390 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 02:25:09,390 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 02:25:09,390 INFO L158 Benchmark]: Toolchain (without parser) took 4561.07ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 112.0MB in the beginning and 74.8MB in the end (delta: 37.3MB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. [2025-02-06 02:25:09,390 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:25:09,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.78ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 98.7MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 02:25:09,392 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.78ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 95.2MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:25:09,392 INFO L158 Benchmark]: Boogie Preprocessor took 51.07ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 88.9MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:25:09,393 INFO L158 Benchmark]: IcfgBuilder took 294.36ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 70.0MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 02:25:09,393 INFO L158 Benchmark]: TraceAbstraction took 3903.36ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 69.6MB in the beginning and 80.6MB in the end (delta: -11.0MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB. [2025-02-06 02:25:09,394 INFO L158 Benchmark]: Witness Printer took 80.67ms. Allocated memory is still 209.7MB. Free memory was 80.6MB in the beginning and 74.8MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:25:09,395 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.78ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 98.7MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.78ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 95.2MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.07ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 88.9MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 294.36ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 70.0MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3903.36ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 69.6MB in the beginning and 80.6MB in the end (delta: -11.0MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB. * Witness Printer took 80.67ms. Allocated memory is still 209.7MB. Free memory was 80.6MB in the beginning and 74.8MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 202 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 202 mSDsluCounter, 792 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 424 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 103 IncrementalHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 368 mSDtfsCounter, 103 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=4, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 21 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 606 NumberOfCodeBlocks, 606 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 600 ConstructedInterpolants, 0 QuantifiedInterpolants, 1037 SizeOfPredicates, 0 NumberOfNonLiveVariables, 245 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 2850/2880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 93]: Location Invariant Derived location invariant: ((((25 <= var_1_1) && (0 <= 0)) && (var_1_18 != 0)) || ((((((((((25 <= var_1_1) && (((var_1_6 == var_1_10) && (var_1_6 <= var_1_11)) || (((var_1_11 + 1) <= var_1_6) && (var_1_11 == var_1_10)))) && (var_1_8 <= ((int) var_1_11 + var_1_7))) && (var_1_20 == var_1_15)) && (var_1_1 == var_1_19)) && (var_1_7 == (((var_1_11 * 65535) + var_1_8) % 65536))) && (0 <= 0)) && ((((short) var_1_13 + var_1_12) % 256) == var_1_11)) && (0 <= var_1_20)) && (var_1_18 == 0))) RESULT: Ultimate proved your program to be correct! [2025-02-06 02:25:09,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE