./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-76.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff4df92f17be79f8174f1685ca28a80f864cb8ac11d461ab1471f692fbb9adc8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:58:18,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:58:18,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:58:18,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:58:18,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:58:19,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:58:19,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:58:19,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:58:19,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:58:19,021 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:58:19,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:58:19,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:58:19,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:58:19,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:58:19,023 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:58:19,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:58:19,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:58:19,023 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:58:19,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:58:19,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:58:19,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:58:19,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:58:19,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:58:19,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:58:19,024 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:58:19,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:58:19,024 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:58:19,024 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:58:19,024 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:58:19,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:58:19,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:58:19,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:58:19,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:58:19,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:58:19,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:58:19,025 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:58:19,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:58:19,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:58:19,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:58:19,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:58:19,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:58:19,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:58:19,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:58:19,026 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff4df92f17be79f8174f1685ca28a80f864cb8ac11d461ab1471f692fbb9adc8 [2025-03-17 02:58:19,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:58:19,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:58:19,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:58:19,250 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:58:19,250 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:58:19,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-76.i [2025-03-17 02:58:20,396 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aad428ee/a1f552b7fa934c52b98ea5ba7e29fb89/FLAGb2810f3af [2025-03-17 02:58:20,646 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:58:20,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-76.i [2025-03-17 02:58:20,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aad428ee/a1f552b7fa934c52b98ea5ba7e29fb89/FLAGb2810f3af [2025-03-17 02:58:20,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aad428ee/a1f552b7fa934c52b98ea5ba7e29fb89 [2025-03-17 02:58:20,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:58:20,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:58:20,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:58:20,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:58:20,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:58:20,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:58:20" (1/1) ... [2025-03-17 02:58:20,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5421906c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:20, skipping insertion in model container [2025-03-17 02:58:20,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:58:20" (1/1) ... [2025-03-17 02:58:20,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:58:21,083 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-76.i[916,929] [2025-03-17 02:58:21,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:58:21,128 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:58:21,134 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-76.i[916,929] [2025-03-17 02:58:21,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:58:21,166 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:58:21,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:21 WrapperNode [2025-03-17 02:58:21,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:58:21,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:58:21,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:58:21,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:58:21,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:21" (1/1) ... [2025-03-17 02:58:21,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:21" (1/1) ... [2025-03-17 02:58:21,192 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2025-03-17 02:58:21,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:58:21,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:58:21,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:58:21,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:58:21,198 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:21" (1/1) ... [2025-03-17 02:58:21,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:21" (1/1) ... [2025-03-17 02:58:21,199 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:21" (1/1) ... [2025-03-17 02:58:21,207 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:58:21,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:21" (1/1) ... [2025-03-17 02:58:21,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:21" (1/1) ... [2025-03-17 02:58:21,210 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:21" (1/1) ... [2025-03-17 02:58:21,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:21" (1/1) ... [2025-03-17 02:58:21,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:21" (1/1) ... [2025-03-17 02:58:21,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:21" (1/1) ... [2025-03-17 02:58:21,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:58:21,213 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:58:21,213 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:58:21,213 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:58:21,214 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:21" (1/1) ... [2025-03-17 02:58:21,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:58:21,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:58:21,242 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:58:21,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:58:21,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:58:21,260 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:58:21,261 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:58:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:58:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:58:21,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:58:21,313 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:58:21,315 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:58:21,485 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 02:58:21,486 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:58:21,493 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:58:21,493 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:58:21,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:58:21 BoogieIcfgContainer [2025-03-17 02:58:21,494 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:58:21,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:58:21,497 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:58:21,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:58:21,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:58:20" (1/3) ... [2025-03-17 02:58:21,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1dc63b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:58:21, skipping insertion in model container [2025-03-17 02:58:21,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:21" (2/3) ... [2025-03-17 02:58:21,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1dc63b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:58:21, skipping insertion in model container [2025-03-17 02:58:21,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:58:21" (3/3) ... [2025-03-17 02:58:21,502 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-76.i [2025-03-17 02:58:21,512 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:58:21,514 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-76.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:58:21,547 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:58:21,557 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;@4e064f2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:58:21,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:58:21,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 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-03-17 02:58:21,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 02:58:21,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:58:21,567 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] [2025-03-17 02:58:21,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:58:21,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:58:21,572 INFO L85 PathProgramCache]: Analyzing trace with hash 55473993, now seen corresponding path program 1 times [2025-03-17 02:58:21,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:58:21,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756146800] [2025-03-17 02:58:21,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:58:21,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:58:21,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 02:58:21,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 02:58:21,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:21,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:58:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 02:58:21,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:58:21,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756146800] [2025-03-17 02:58:21,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756146800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:58:21,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214194687] [2025-03-17 02:58:21,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:58:21,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:58:21,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:58:21,752 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:58:21,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 02:58:21,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 02:58:21,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 02:58:21,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:21,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:58:21,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:58:21,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:58:21,876 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 02:58:21,879 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:58:21,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214194687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:58:21,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:58:21,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:58:21,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008873610] [2025-03-17 02:58:21,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:58:21,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:58:21,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:58:21,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:58:21,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:58:21,896 INFO L87 Difference]: Start difference. First operand has 46 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 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 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-03-17 02:58:21,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:58:21,909 INFO L93 Difference]: Finished difference Result 89 states and 156 transitions. [2025-03-17 02:58:21,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:58:21,910 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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 98 [2025-03-17 02:58:21,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:58:21,915 INFO L225 Difference]: With dead ends: 89 [2025-03-17 02:58:21,915 INFO L226 Difference]: Without dead ends: 44 [2025-03-17 02:58:21,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:58:21,921 INFO L435 NwaCegarLoop]: 66 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, 66 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-03-17 02:58:21,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:58:21,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-17 02:58:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-17 02:58:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 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-03-17 02:58:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2025-03-17 02:58:21,952 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 98 [2025-03-17 02:58:21,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:58:21,952 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2025-03-17 02:58:21,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-03-17 02:58:21,952 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2025-03-17 02:58:21,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 02:58:21,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:58:21,955 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] [2025-03-17 02:58:21,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 02:58:22,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:58:22,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:58:22,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:58:22,157 INFO L85 PathProgramCache]: Analyzing trace with hash 968551321, now seen corresponding path program 1 times [2025-03-17 02:58:22,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:58:22,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857431098] [2025-03-17 02:58:22,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:58:22,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:58:22,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 02:58:22,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 02:58:22,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:22,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:58:22,341 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 02:58:22,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:58:22,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857431098] [2025-03-17 02:58:22,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857431098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:58:22,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:58:22,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:58:22,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757830481] [2025-03-17 02:58:22,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:58:22,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:58:22,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:58:22,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:58:22,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:58:22,345 INFO L87 Difference]: Start difference. First operand 44 states and 66 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-03-17 02:58:22,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:58:22,361 INFO L93 Difference]: Finished difference Result 87 states and 131 transitions. [2025-03-17 02:58:22,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:58:22,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 99 [2025-03-17 02:58:22,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:58:22,363 INFO L225 Difference]: With dead ends: 87 [2025-03-17 02:58:22,363 INFO L226 Difference]: Without dead ends: 44 [2025-03-17 02:58:22,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:58:22,364 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:58:22,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:58:22,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-17 02:58:22,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-17 02:58:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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-03-17 02:58:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2025-03-17 02:58:22,369 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 99 [2025-03-17 02:58:22,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:58:22,370 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2025-03-17 02:58:22,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-03-17 02:58:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2025-03-17 02:58:22,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 02:58:22,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:58:22,371 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] [2025-03-17 02:58:22,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:58:22,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:58:22,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:58:22,372 INFO L85 PathProgramCache]: Analyzing trace with hash -838903142, now seen corresponding path program 1 times [2025-03-17 02:58:22,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:58:22,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936812987] [2025-03-17 02:58:22,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:58:22,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:58:22,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 02:58:22,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 02:58:22,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:22,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:58:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 02:58:22,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:58:22,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936812987] [2025-03-17 02:58:22,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936812987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:58:22,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:58:22,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:58:22,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198318171] [2025-03-17 02:58:22,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:58:22,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:58:22,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:58:22,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:58:22,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:58:22,507 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-03-17 02:58:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:58:22,531 INFO L93 Difference]: Finished difference Result 87 states and 129 transitions. [2025-03-17 02:58:22,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:58:22,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 99 [2025-03-17 02:58:22,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:58:22,532 INFO L225 Difference]: With dead ends: 87 [2025-03-17 02:58:22,533 INFO L226 Difference]: Without dead ends: 44 [2025-03-17 02:58:22,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:58:22,534 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 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-03-17 02:58:22,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:58:22,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-17 02:58:22,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-17 02:58:22,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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-03-17 02:58:22,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2025-03-17 02:58:22,538 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 99 [2025-03-17 02:58:22,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:58:22,539 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2025-03-17 02:58:22,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-03-17 02:58:22,539 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2025-03-17 02:58:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 02:58:22,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:58:22,540 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] [2025-03-17 02:58:22,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:58:22,540 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:58:22,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:58:22,541 INFO L85 PathProgramCache]: Analyzing trace with hash -262884406, now seen corresponding path program 1 times [2025-03-17 02:58:22,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:58:22,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66746341] [2025-03-17 02:58:22,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:58:22,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:58:22,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 02:58:22,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 02:58:22,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:22,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:58:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 02:58:22,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:58:22,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66746341] [2025-03-17 02:58:22,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66746341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:58:22,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:58:22,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:58:22,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332857584] [2025-03-17 02:58:22,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:58:22,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:58:22,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:58:22,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:58:22,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:58:22,632 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-03-17 02:58:22,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:58:22,665 INFO L93 Difference]: Finished difference Result 126 states and 183 transitions. [2025-03-17 02:58:22,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:58:22,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 100 [2025-03-17 02:58:22,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:58:22,667 INFO L225 Difference]: With dead ends: 126 [2025-03-17 02:58:22,670 INFO L226 Difference]: Without dead ends: 83 [2025-03-17 02:58:22,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:58:22,671 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 54 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:58:22,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 122 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:58:22,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-17 02:58:22,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 48. [2025-03-17 02:58:22,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 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-03-17 02:58:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-03-17 02:58:22,681 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 100 [2025-03-17 02:58:22,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:58:22,683 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-03-17 02:58:22,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-03-17 02:58:22,683 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2025-03-17 02:58:22,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 02:58:22,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:58:22,684 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] [2025-03-17 02:58:22,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 02:58:22,685 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:58:22,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:58:22,685 INFO L85 PathProgramCache]: Analyzing trace with hash -261960885, now seen corresponding path program 1 times [2025-03-17 02:58:22,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:58:22,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888205672] [2025-03-17 02:58:22,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:58:22,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:58:22,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 02:58:22,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 02:58:22,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:22,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:58:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 02:58:23,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:58:23,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888205672] [2025-03-17 02:58:23,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888205672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:58:23,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:58:23,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:58:23,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515851465] [2025-03-17 02:58:23,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:58:23,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:58:23,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:58:23,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:58:23,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:58:23,707 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-03-17 02:58:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:58:23,868 INFO L93 Difference]: Finished difference Result 129 states and 174 transitions. [2025-03-17 02:58:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 02:58:23,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 100 [2025-03-17 02:58:23,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:58:23,872 INFO L225 Difference]: With dead ends: 129 [2025-03-17 02:58:23,872 INFO L226 Difference]: Without dead ends: 82 [2025-03-17 02:58:23,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:58:23,873 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 73 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:58:23,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 192 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:58:23,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-17 02:58:23,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2025-03-17 02:58:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.1875) internal successors, (57), 49 states have internal predecessors, (57), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 02:58:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 93 transitions. [2025-03-17 02:58:23,888 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 93 transitions. Word has length 100 [2025-03-17 02:58:23,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:58:23,889 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 93 transitions. [2025-03-17 02:58:23,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-03-17 02:58:23,889 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2025-03-17 02:58:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 02:58:23,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:58:23,893 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-03-17 02:58:23,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 02:58:23,893 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:58:23,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:58:23,894 INFO L85 PathProgramCache]: Analyzing trace with hash 441473274, now seen corresponding path program 1 times [2025-03-17 02:58:23,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:58:23,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384956317] [2025-03-17 02:58:23,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:58:23,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:58:23,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 02:58:23,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 02:58:23,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:23,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:58:24,202 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 02:58:24,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:58:24,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384956317] [2025-03-17 02:58:24,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384956317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:58:24,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594497917] [2025-03-17 02:58:24,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:58:24,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:58:24,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:58:24,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:58:24,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 02:58:24,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 02:58:24,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 02:58:24,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:24,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:58:24,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 02:58:24,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:58:24,417 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-17 02:58:24,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:58:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 02:58:24,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594497917] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 02:58:24,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 02:58:24,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-17 02:58:24,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643998677] [2025-03-17 02:58:24,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 02:58:24,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:58:24,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:58:24,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:58:24,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:58:24,576 INFO L87 Difference]: Start difference. First operand 70 states and 93 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 02:58:24,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:58:24,844 INFO L93 Difference]: Finished difference Result 180 states and 235 transitions. [2025-03-17 02:58:24,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 02:58:24,844 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 101 [2025-03-17 02:58:24,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:58:24,846 INFO L225 Difference]: With dead ends: 180 [2025-03-17 02:58:24,847 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 02:58:24,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-03-17 02:58:24,848 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 94 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:58:24,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 146 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:58:24,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 02:58:24,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 65. [2025-03-17 02:58:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 43 states have internal predecessors, (44), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 02:58:24,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2025-03-17 02:58:24,860 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 101 [2025-03-17 02:58:24,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:58:24,861 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2025-03-17 02:58:24,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 02:58:24,861 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2025-03-17 02:58:24,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 02:58:24,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:58:24,862 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-03-17 02:58:24,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 02:58:25,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 02:58:25,063 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:58:25,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:58:25,064 INFO L85 PathProgramCache]: Analyzing trace with hash -470443783, now seen corresponding path program 1 times [2025-03-17 02:58:25,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:58:25,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470126611] [2025-03-17 02:58:25,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:58:25,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:58:25,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 02:58:25,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 02:58:25,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:25,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:58:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 02:58:25,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:58:25,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470126611] [2025-03-17 02:58:25,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470126611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:58:25,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:58:25,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:58:25,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137005938] [2025-03-17 02:58:25,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:58:25,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:58:25,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:58:25,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:58:25,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:58:25,756 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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-03-17 02:58:25,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:58:25,877 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2025-03-17 02:58:25,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 02:58:25,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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-03-17 02:58:25,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:58:25,879 INFO L225 Difference]: With dead ends: 77 [2025-03-17 02:58:25,879 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 02:58:25,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:58:25,880 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 43 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:58:25,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 176 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:58:25,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 02:58:25,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 02:58:25,882 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-03-17 02:58:25,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 02:58:25,882 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2025-03-17 02:58:25,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:58:25,882 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 02:58:25,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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-03-17 02:58:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 02:58:25,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 02:58:25,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:58:25,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 02:58:25,887 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:58:25,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 02:58:26,295 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:58:26,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:58:26 BoogieIcfgContainer [2025-03-17 02:58:26,304 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:58:26,305 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:58:26,305 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:58:26,305 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:58:26,305 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:58:21" (3/4) ... [2025-03-17 02:58:26,307 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 02:58:26,312 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 02:58:26,317 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-17 02:58:26,319 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 02:58:26,319 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 02:58:26,319 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 02:58:26,388 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 02:58:26,388 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 02:58:26,388 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:58:26,389 INFO L158 Benchmark]: Toolchain (without parser) took 5437.04ms. Allocated memory was 142.6MB in the beginning and 260.0MB in the end (delta: 117.4MB). Free memory was 111.6MB in the beginning and 128.7MB in the end (delta: -17.1MB). Peak memory consumption was 102.3MB. Max. memory is 16.1GB. [2025-03-17 02:58:26,390 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:58:26,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.01ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 99.1MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:58:26,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.34ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 97.4MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:58:26,393 INFO L158 Benchmark]: Boogie Preprocessor took 20.11ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 95.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:58:26,393 INFO L158 Benchmark]: IcfgBuilder took 280.91ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 79.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:58:26,393 INFO L158 Benchmark]: TraceAbstraction took 4807.35ms. Allocated memory was 142.6MB in the beginning and 260.0MB in the end (delta: 117.4MB). Free memory was 78.7MB in the beginning and 135.0MB in the end (delta: -56.3MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. [2025-03-17 02:58:26,393 INFO L158 Benchmark]: Witness Printer took 83.47ms. Allocated memory is still 260.0MB. Free memory was 135.0MB in the beginning and 128.7MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:58:26,394 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.43ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.01ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 99.1MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.34ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 97.4MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.11ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 95.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 280.91ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 79.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4807.35ms. Allocated memory was 142.6MB in the beginning and 260.0MB in the end (delta: 117.4MB). Free memory was 78.7MB in the beginning and 135.0MB in the end (delta: -56.3MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. * Witness Printer took 83.47ms. Allocated memory is still 260.0MB. Free memory was 135.0MB in the beginning and 128.7MB in the end (delta: 6.3MB). 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, 87 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 7, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 284 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 264 mSDsluCounter, 945 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 504 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 382 IncrementalHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 441 mSDtfsCounter, 382 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 345 GetRequests, 312 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=5, InterpolantAutomatonStates: 42, 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, 7 MinimizatonAttempts, 93 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 897 NumberOfCodeBlocks, 897 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 988 ConstructedInterpolants, 0 QuantifiedInterpolants, 2217 SizeOfPredicates, 2 NumberOfNonLiveVariables, 471 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 4680/4800 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: 107]: Location Invariant Derived location invariant: (((var_1_4 != var_1_10) || (((((240 + var_1_11) % 256) == var_1_8) || ((128 <= ((240 + var_1_11) % 256)) && (((240 + var_1_11) % 256) == (256 + var_1_8)))) && ((((240 + var_1_11) % 256) < 128) || (((240 + var_1_11) % 256) != var_1_8)))) && (var_1_5 == 0)) RESULT: Ultimate proved your program to be correct! [2025-03-17 02:58:26,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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