./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-10.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_codestructure_dependencies_file-10.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 7a3066d73095e1fdcb5cedffd45d35ce8e4fafd1dd368f5e708224be9a677a7a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:16:32,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:16:32,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 20:16:32,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:16:32,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:16:32,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:16:32,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:16:32,885 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:16:32,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:16:32,886 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:16:32,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:16:32,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:16:32,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:16:32,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:16:32,886 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:16:32,886 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:16:32,886 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:16:32,886 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:16:32,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:16:32,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:16:32,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:16:32,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:16:32,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:16:32,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:16:32,888 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:16:32,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:16:32,888 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:16:32,888 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:16:32,888 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:16:32,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:16:32,889 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:16:32,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:16:32,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:16:32,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:16:32,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:16:32,889 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:16:32,889 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:16:32,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:16:32,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:16:32,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:16:32,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:16:32,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:16:32,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:16:32,889 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 -> 7a3066d73095e1fdcb5cedffd45d35ce8e4fafd1dd368f5e708224be9a677a7a [2025-02-05 20:16:33,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:16:33,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:16:33,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:16:33,146 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:16:33,146 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:16:33,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-10.i [2025-02-05 20:16:34,299 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c84b759af/56288346936440bbacbace73f54aad62/FLAGd74f4f6ab [2025-02-05 20:16:34,556 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:16:34,556 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-10.i [2025-02-05 20:16:34,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c84b759af/56288346936440bbacbace73f54aad62/FLAGd74f4f6ab [2025-02-05 20:16:34,901 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c84b759af/56288346936440bbacbace73f54aad62 [2025-02-05 20:16:34,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:16:34,905 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:16:34,907 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:16:34,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:16:34,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:16:34,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:16:34" (1/1) ... [2025-02-05 20:16:34,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e8db609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:34, skipping insertion in model container [2025-02-05 20:16:34,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:16:34" (1/1) ... [2025-02-05 20:16:34,943 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:16:35,029 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_codestructure_dependencies_file-10.i[919,932] [2025-02-05 20:16:35,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:16:35,089 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:16:35,096 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_codestructure_dependencies_file-10.i[919,932] [2025-02-05 20:16:35,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:16:35,126 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:16:35,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:35 WrapperNode [2025-02-05 20:16:35,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:16:35,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:16:35,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:16:35,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:16:35,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:35" (1/1) ... [2025-02-05 20:16:35,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:35" (1/1) ... [2025-02-05 20:16:35,178 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160 [2025-02-05 20:16:35,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:16:35,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:16:35,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:16:35,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:16:35,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:35" (1/1) ... [2025-02-05 20:16:35,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:35" (1/1) ... [2025-02-05 20:16:35,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:35" (1/1) ... [2025-02-05 20:16:35,216 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-05 20:16:35,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:35" (1/1) ... [2025-02-05 20:16:35,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:35" (1/1) ... [2025-02-05 20:16:35,229 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:35" (1/1) ... [2025-02-05 20:16:35,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:35" (1/1) ... [2025-02-05 20:16:35,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:35" (1/1) ... [2025-02-05 20:16:35,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:35" (1/1) ... [2025-02-05 20:16:35,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:16:35,242 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:16:35,242 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:16:35,242 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:16:35,243 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:35" (1/1) ... [2025-02-05 20:16:35,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:16:35,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:16:35,267 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-05 20:16:35,273 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-05 20:16:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:16:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:16:35,291 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:16:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:16:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:16:35,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:16:35,346 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:16:35,347 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:16:35,670 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L111: havoc property_#t~bitwise16#1;havoc property_#t~ite18#1;havoc property_#t~bitwise17#1;havoc property_#t~short19#1; [2025-02-05 20:16:35,690 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 20:16:35,692 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:16:35,703 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:16:35,703 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:16:35,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:16:35 BoogieIcfgContainer [2025-02-05 20:16:35,703 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:16:35,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:16:35,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:16:35,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:16:35,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:16:34" (1/3) ... [2025-02-05 20:16:35,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37388a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:16:35, skipping insertion in model container [2025-02-05 20:16:35,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:35" (2/3) ... [2025-02-05 20:16:35,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37388a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:16:35, skipping insertion in model container [2025-02-05 20:16:35,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:16:35" (3/3) ... [2025-02-05 20:16:35,711 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-10.i [2025-02-05 20:16:35,721 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:16:35,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-10.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:16:35,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:16:35,772 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;@54fc9b18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:16:35,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:16:35,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-05 20:16:35,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 20:16:35,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:35,789 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:16:35,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:35,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:35,792 INFO L85 PathProgramCache]: Analyzing trace with hash -551768720, now seen corresponding path program 1 times [2025-02-05 20:16:35,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:35,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080559194] [2025-02-05 20:16:35,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:35,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:35,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 20:16:35,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 20:16:35,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:35,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:36,045 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-05 20:16:36,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:36,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080559194] [2025-02-05 20:16:36,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080559194] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:16:36,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124998351] [2025-02-05 20:16:36,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:36,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:16:36,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:16:36,050 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-05 20:16:36,051 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-05 20:16:36,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 20:16:36,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 20:16:36,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:36,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:36,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:16:36,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:16:36,192 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-05 20:16:36,192 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:16:36,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124998351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:36,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:16:36,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:16:36,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234543891] [2025-02-05 20:16:36,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:36,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:16:36,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:36,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:16:36,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:16:36,214 INFO L87 Difference]: Start difference. First operand has 70 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 20:16:36,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:36,236 INFO L93 Difference]: Finished difference Result 134 states and 223 transitions. [2025-02-05 20:16:36,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:16:36,238 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2025-02-05 20:16:36,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:36,242 INFO L225 Difference]: With dead ends: 134 [2025-02-05 20:16:36,243 INFO L226 Difference]: Without dead ends: 67 [2025-02-05 20:16:36,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 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-05 20:16:36,246 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 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-05 20:16:36,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:16:36,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-05 20:16:36,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-05 20:16:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-05 20:16:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2025-02-05 20:16:36,288 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 119 [2025-02-05 20:16:36,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:36,289 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2025-02-05 20:16:36,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 20:16:36,289 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2025-02-05 20:16:36,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 20:16:36,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:36,292 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:16:36,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 20:16:36,493 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-05 20:16:36,493 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:36,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:36,493 INFO L85 PathProgramCache]: Analyzing trace with hash -754242032, now seen corresponding path program 1 times [2025-02-05 20:16:36,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:36,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707579195] [2025-02-05 20:16:36,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:36,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:36,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 20:16:36,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 20:16:36,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:36,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:36,919 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-05 20:16:36,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:36,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707579195] [2025-02-05 20:16:36,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707579195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:36,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:36,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:16:36,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133112751] [2025-02-05 20:16:36,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:36,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:16:36,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:36,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:16:36,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:16:36,922 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-05 20:16:37,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:37,059 INFO L93 Difference]: Finished difference Result 196 states and 295 transitions. [2025-02-05 20:16:37,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:16:37,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-02-05 20:16:37,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:37,061 INFO L225 Difference]: With dead ends: 196 [2025-02-05 20:16:37,061 INFO L226 Difference]: Without dead ends: 132 [2025-02-05 20:16:37,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:16:37,062 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:37,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 267 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:16:37,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-05 20:16:37,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 101. [2025-02-05 20:16:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 62 states have internal predecessors, (79), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 20:16:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 151 transitions. [2025-02-05 20:16:37,086 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 151 transitions. Word has length 119 [2025-02-05 20:16:37,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:37,086 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 151 transitions. [2025-02-05 20:16:37,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-05 20:16:37,087 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 151 transitions. [2025-02-05 20:16:37,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 20:16:37,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:37,088 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:16:37,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:16:37,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:37,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:37,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1858652832, now seen corresponding path program 1 times [2025-02-05 20:16:37,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:37,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253777306] [2025-02-05 20:16:37,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:37,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:37,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 20:16:37,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 20:16:37,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:37,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:17:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-05 20:17:21,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:17:21,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253777306] [2025-02-05 20:17:21,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253777306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:17:21,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:17:21,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:17:21,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087106507] [2025-02-05 20:17:21,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:17:21,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:17:21,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:17:21,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:17:21,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:17:21,483 INFO L87 Difference]: Start difference. First operand 101 states and 151 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-05 20:17:22,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:17:22,378 INFO L93 Difference]: Finished difference Result 287 states and 421 transitions. [2025-02-05 20:17:22,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:17:22,379 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2025-02-05 20:17:22,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:17:22,381 INFO L225 Difference]: With dead ends: 287 [2025-02-05 20:17:22,381 INFO L226 Difference]: Without dead ends: 223 [2025-02-05 20:17:22,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:17:22,382 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 335 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:17:22,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 424 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:17:22,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-05 20:17:22,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 116. [2025-02-05 20:17:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 20:17:22,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 173 transitions. [2025-02-05 20:17:22,400 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 173 transitions. Word has length 120 [2025-02-05 20:17:22,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:17:22,401 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 173 transitions. [2025-02-05 20:17:22,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-05 20:17:22,401 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 173 transitions. [2025-02-05 20:17:22,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 20:17:22,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:17:22,402 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:17:22,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:17:22,402 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:17:22,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:17:22,403 INFO L85 PathProgramCache]: Analyzing trace with hash -758148257, now seen corresponding path program 1 times [2025-02-05 20:17:22,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:17:22,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879070205] [2025-02-05 20:17:22,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:17:22,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:17:22,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 20:17:22,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 20:17:22,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:17:22,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:18:00,352 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-05 20:18:00,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:18:00,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879070205] [2025-02-05 20:18:00,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879070205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:18:00,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:18:00,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 20:18:00,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846301519] [2025-02-05 20:18:00,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:18:00,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 20:18:00,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:18:00,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 20:18:00,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:18:00,355 INFO L87 Difference]: Start difference. First operand 116 states and 173 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 20:18:01,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:18:01,907 INFO L93 Difference]: Finished difference Result 342 states and 495 transitions. [2025-02-05 20:18:01,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 20:18:01,908 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2025-02-05 20:18:01,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:18:01,909 INFO L225 Difference]: With dead ends: 342 [2025-02-05 20:18:01,909 INFO L226 Difference]: Without dead ends: 263 [2025-02-05 20:18:01,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:18:01,914 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 411 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:18:01,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 368 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 20:18:01,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-05 20:18:01,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 128. [2025-02-05 20:18:01,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 89 states have (on average 1.3707865168539326) internal successors, (122), 89 states have internal predecessors, (122), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 20:18:01,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 194 transitions. [2025-02-05 20:18:01,935 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 194 transitions. Word has length 120 [2025-02-05 20:18:01,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:18:01,935 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 194 transitions. [2025-02-05 20:18:01,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 20:18:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 194 transitions. [2025-02-05 20:18:01,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 20:18:01,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:18:01,939 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:18:01,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:18:01,940 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:18:01,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:18:01,940 INFO L85 PathProgramCache]: Analyzing trace with hash 984662078, now seen corresponding path program 1 times [2025-02-05 20:18:01,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:18:01,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030668083] [2025-02-05 20:18:01,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:18:01,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:18:01,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 20:18:01,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 20:18:01,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:18:01,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat