./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/underapprox_1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/loop-acceleration/underapprox_1-2.c -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 3627a732530e36fdf7a132fca7d3f33785550e6f2e2a95fdbae864743bbd37d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:15:31,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:15:31,165 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:15:31,172 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:15:31,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:15:31,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:15:31,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:15:31,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:15:31,200 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:15:31,200 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:15:31,201 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:15:31,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:15:31,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:15:31,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:15:31,201 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:15:31,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:15:31,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:15:31,202 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:15:31,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:15:31,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:15:31,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:15:31,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:15:31,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:15:31,202 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:15:31,203 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:15:31,203 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:15:31,203 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:15:31,203 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:15:31,203 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:15:31,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:15:31,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:15:31,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:15:31,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:15:31,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:15:31,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:15:31,204 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:15:31,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:15:31,204 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:15:31,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:15:31,204 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:15:31,204 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:15:31,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:15:31,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:15:31,205 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 -> 3627a732530e36fdf7a132fca7d3f33785550e6f2e2a95fdbae864743bbd37d1 [2025-02-07 20:15:31,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:15:31,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:15:31,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:15:31,416 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:15:31,417 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:15:31,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/underapprox_1-2.c [2025-02-07 20:15:32,545 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/613d990f8/43ec3d979db5458bafa07181ac0f53ec/FLAG5b81284e2 [2025-02-07 20:15:32,740 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:15:32,741 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-acceleration/underapprox_1-2.c [2025-02-07 20:15:32,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/613d990f8/43ec3d979db5458bafa07181ac0f53ec/FLAG5b81284e2 [2025-02-07 20:15:32,771 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/613d990f8/43ec3d979db5458bafa07181ac0f53ec [2025-02-07 20:15:32,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:15:32,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:15:32,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:15:32,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:15:32,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:15:32,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:15:32" (1/1) ... [2025-02-07 20:15:32,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5224d853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:15:32, skipping insertion in model container [2025-02-07 20:15:32,781 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:15:32" (1/1) ... [2025-02-07 20:15:32,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:15:32,894 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/loop-acceleration/underapprox_1-2.c[327,340] [2025-02-07 20:15:32,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:15:32,911 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:15:32,918 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/loop-acceleration/underapprox_1-2.c[327,340] [2025-02-07 20:15:32,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:15:32,929 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:15:32,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:15:32 WrapperNode [2025-02-07 20:15:32,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:15:32,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:15:32,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:15:32,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:15:32,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:15:32" (1/1) ... [2025-02-07 20:15:32,946 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:15:32" (1/1) ... [2025-02-07 20:15:32,957 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 23 [2025-02-07 20:15:32,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:15:32,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:15:32,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:15:32,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:15:32,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:15:32" (1/1) ... [2025-02-07 20:15:32,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:15:32" (1/1) ... [2025-02-07 20:15:32,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:15:32" (1/1) ... [2025-02-07 20:15:32,974 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-07 20:15:32,975 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:15:32" (1/1) ... [2025-02-07 20:15:32,975 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:15:32" (1/1) ... [2025-02-07 20:15:32,976 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:15:32" (1/1) ... [2025-02-07 20:15:32,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:15:32" (1/1) ... [2025-02-07 20:15:32,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:15:32" (1/1) ... [2025-02-07 20:15:32,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:15:32" (1/1) ... [2025-02-07 20:15:32,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:15:32,980 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:15:32,981 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:15:32,981 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:15:32,982 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:15:32" (1/1) ... [2025-02-07 20:15:32,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:15:32,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:15:33,007 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-07 20:15:33,009 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-07 20:15:33,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:15:33,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:15:33,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:15:33,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:15:33,058 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:15:33,059 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:15:33,127 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-02-07 20:15:33,128 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:15:33,134 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:15:33,134 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:15:33,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:15:33 BoogieIcfgContainer [2025-02-07 20:15:33,134 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:15:33,136 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:15:33,136 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:15:33,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:15:33,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:15:32" (1/3) ... [2025-02-07 20:15:33,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b26c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:15:33, skipping insertion in model container [2025-02-07 20:15:33,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:15:32" (2/3) ... [2025-02-07 20:15:33,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b26c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:15:33, skipping insertion in model container [2025-02-07 20:15:33,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:15:33" (3/3) ... [2025-02-07 20:15:33,140 INFO L128 eAbstractionObserver]: Analyzing ICFG underapprox_1-2.c [2025-02-07 20:15:33,148 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:15:33,149 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG underapprox_1-2.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 20:15:33,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:15:33,182 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;@10028fa2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:15:33,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:15:33,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:33,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 20:15:33,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:15:33,187 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 20:15:33,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:15:33,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:15:33,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1136958, now seen corresponding path program 1 times [2025-02-07 20:15:33,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:15:33,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940717055] [2025-02-07 20:15:33,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:15:33,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:15:33,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 20:15:33,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 20:15:33,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:15:33,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:15:33,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:15:33,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:15:33,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940717055] [2025-02-07 20:15:33,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940717055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:15:33,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:15:33,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:15:33,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060750444] [2025-02-07 20:15:33,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:15:33,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:15:33,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:15:33,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:15:33,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:15:33,325 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:33,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:15:33,336 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2025-02-07 20:15:33,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:15:33,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2025-02-07 20:15:33,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:15:33,344 INFO L225 Difference]: With dead ends: 15 [2025-02-07 20:15:33,344 INFO L226 Difference]: Without dead ends: 6 [2025-02-07 20:15:33,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:15:33,347 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 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-07 20:15:33,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:15:33,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2025-02-07 20:15:33,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2025-02-07 20:15:33,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:33,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2025-02-07 20:15:33,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2025-02-07 20:15:33,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:15:33,363 INFO L471 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2025-02-07 20:15:33,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:33,363 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2025-02-07 20:15:33,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-07 20:15:33,364 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:15:33,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-07 20:15:33,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:15:33,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:15:33,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:15:33,365 INFO L85 PathProgramCache]: Analyzing trace with hash 35277444, now seen corresponding path program 1 times [2025-02-07 20:15:33,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:15:33,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705528650] [2025-02-07 20:15:33,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:15:33,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:15:33,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-07 20:15:33,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-07 20:15:33,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:15:33,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:15:33,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:15:33,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:15:33,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705528650] [2025-02-07 20:15:33,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705528650] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:15:33,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447904865] [2025-02-07 20:15:33,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:15:33,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:15:33,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:15:33,456 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-07 20:15:33,457 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-07 20:15:33,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-07 20:15:33,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-07 20:15:33,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:15:33,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:15:33,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 20:15:33,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:15:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:15:33,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:15:33,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:15:33,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447904865] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:15:33,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:15:33,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-07 20:15:33,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490278149] [2025-02-07 20:15:33,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:15:33,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:15:33,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:15:33,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:15:33,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:15:33,552 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:33,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:15:33,582 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2025-02-07 20:15:33,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:15:33,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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) Word has length 5 [2025-02-07 20:15:33,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:15:33,582 INFO L225 Difference]: With dead ends: 12 [2025-02-07 20:15:33,582 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 20:15:33,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:15:33,583 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:15:33,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:15:33,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 20:15:33,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-02-07 20:15:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:33,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-02-07 20:15:33,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-02-07 20:15:33,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:15:33,585 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-02-07 20:15:33,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:33,585 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-02-07 20:15:33,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 20:15:33,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:15:33,586 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2025-02-07 20:15:33,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 20:15:33,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:15:33,790 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:15:33,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:15:33,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1285129538, now seen corresponding path program 2 times [2025-02-07 20:15:33,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:15:33,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278180993] [2025-02-07 20:15:33,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:15:33,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:15:33,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-02-07 20:15:33,804 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 20:15:33,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:15:33,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:15:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:15:33,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:15:33,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278180993] [2025-02-07 20:15:33,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278180993] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:15:33,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480838416] [2025-02-07 20:15:33,922 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:15:33,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:15:33,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:15:33,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:15:33,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 20:15:33,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-02-07 20:15:33,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 20:15:33,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:15:33,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:15:33,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 20:15:33,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:15:33,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:15:33,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:15:34,084 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:15:34,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480838416] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:15:34,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:15:34,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-07 20:15:34,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570166601] [2025-02-07 20:15:34,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:15:34,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 20:15:34,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:15:34,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 20:15:34,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-07 20:15:34,087 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:15:34,119 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2025-02-07 20:15:34,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:15:34,120 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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) Word has length 8 [2025-02-07 20:15:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:15:34,120 INFO L225 Difference]: With dead ends: 14 [2025-02-07 20:15:34,120 INFO L226 Difference]: Without dead ends: 11 [2025-02-07 20:15:34,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-07 20:15:34,121 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:15:34,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:15:34,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-07 20:15:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-07 20:15:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:34,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-02-07 20:15:34,123 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2025-02-07 20:15:34,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:15:34,123 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-02-07 20:15:34,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:34,124 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-02-07 20:15:34,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 20:15:34,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:15:34,124 INFO L218 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2025-02-07 20:15:34,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 20:15:34,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:15:34,325 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:15:34,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:15:34,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1942111102, now seen corresponding path program 3 times [2025-02-07 20:15:34,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:15:34,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675985589] [2025-02-07 20:15:34,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:15:34,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:15:34,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 10 statements into 4 equivalence classes. [2025-02-07 20:15:34,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 20:15:34,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 20:15:34,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:15:34,588 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:15:34,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:15:34,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675985589] [2025-02-07 20:15:34,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675985589] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:15:34,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740770825] [2025-02-07 20:15:34,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:15:34,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:15:34,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:15:34,590 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:15:34,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 20:15:34,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 10 statements into 4 equivalence classes. [2025-02-07 20:15:34,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 20:15:34,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 20:15:34,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:15:34,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-07 20:15:34,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:15:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:15:35,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:15:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:15:35,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740770825] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:15:35,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:15:35,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-07 20:15:35,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741191646] [2025-02-07 20:15:35,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:15:35,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-07 20:15:35,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:15:35,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-07 20:15:35,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-02-07 20:15:35,748 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:15:37,457 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2025-02-07 20:15:37,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 20:15:37,458 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 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) Word has length 10 [2025-02-07 20:15:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:15:37,458 INFO L225 Difference]: With dead ends: 23 [2025-02-07 20:15:37,458 INFO L226 Difference]: Without dead ends: 19 [2025-02-07 20:15:37,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-02-07 20:15:37,459 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:15:37,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:15:37,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-02-07 20:15:37,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-02-07 20:15:37,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:37,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2025-02-07 20:15:37,469 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 10 [2025-02-07 20:15:37,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:15:37,469 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2025-02-07 20:15:37,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:37,469 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2025-02-07 20:15:37,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 20:15:37,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:15:37,472 INFO L218 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1] [2025-02-07 20:15:37,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 20:15:37,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:15:37,674 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:15:37,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:15:37,674 INFO L85 PathProgramCache]: Analyzing trace with hash -292452738, now seen corresponding path program 4 times [2025-02-07 20:15:37,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:15:37,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330019078] [2025-02-07 20:15:37,674 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 20:15:37,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:15:37,684 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-02-07 20:15:37,701 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:15:37,704 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 20:15:37,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:15:37,815 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 56 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-07 20:15:37,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:15:37,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330019078] [2025-02-07 20:15:37,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330019078] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:15:37,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755643551] [2025-02-07 20:15:37,815 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 20:15:37,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:15:37,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:15:37,817 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:15:37,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 20:15:37,837 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-02-07 20:15:37,848 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:15:37,849 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 20:15:37,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:15:37,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-07 20:15:37,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:15:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 36 proven. 66 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 20:15:37,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:15:38,126 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 36 proven. 66 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 20:15:38,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755643551] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:15:38,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:15:38,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 26 [2025-02-07 20:15:38,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709567403] [2025-02-07 20:15:38,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:15:38,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-07 20:15:38,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:15:38,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-07 20:15:38,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2025-02-07 20:15:38,128 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:38,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:15:38,158 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2025-02-07 20:15:38,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 20:15:38,158 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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) Word has length 18 [2025-02-07 20:15:38,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:15:38,158 INFO L225 Difference]: With dead ends: 19 [2025-02-07 20:15:38,158 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 20:15:38,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2025-02-07 20:15:38,159 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:15:38,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:15:38,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 20:15:38,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 20:15:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 20:15:38,160 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2025-02-07 20:15:38,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:15:38,160 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 20:15:38,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 20:15:38,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 20:15:38,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 20:15:38,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 20:15:38,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:15:38,372 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1] [2025-02-07 20:15:38,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 20:15:38,460 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:15:38,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:15:38 BoogieIcfgContainer [2025-02-07 20:15:38,487 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:15:38,487 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:15:38,487 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:15:38,487 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:15:38,494 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:15:33" (3/4) ... [2025-02-07 20:15:38,495 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 20:15:38,504 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-07 20:15:38,504 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-07 20:15:38,504 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 20:15:38,504 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 20:15:38,604 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:15:38,604 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:15:38,604 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:15:38,604 INFO L158 Benchmark]: Toolchain (without parser) took 5829.96ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 73.2MB in the end (delta: 40.1MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2025-02-07 20:15:38,607 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:15:38,608 INFO L158 Benchmark]: CACSL2BoogieTranslator took 154.91ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 102.4MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:15:38,608 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.74ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.5MB in the end (delta: 903.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:15:38,608 INFO L158 Benchmark]: Boogie Preprocessor took 20.84ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.5MB in the end (delta: 958.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:15:38,608 INFO L158 Benchmark]: IcfgBuilder took 154.22ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 90.7MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:15:38,608 INFO L158 Benchmark]: TraceAbstraction took 5350.82ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 78.9MB in the end (delta: 11.4MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2025-02-07 20:15:38,608 INFO L158 Benchmark]: Witness Printer took 116.80ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 73.2MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:15:38,612 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.18ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 154.91ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 102.4MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.74ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.5MB in the end (delta: 903.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.84ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.5MB in the end (delta: 958.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 154.22ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 90.7MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5350.82ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 78.9MB in the end (delta: 11.4MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Witness Printer took 116.80ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 73.2MB in the end (delta: 5.6MB). There was no memory consumed. 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: 7]: 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 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 222 IncrementalHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 19 mSDtfsCounter, 222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=4, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 114 ConstructedInterpolants, 1 QuantifiedInterpolants, 755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 257 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 162/411 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: 16]: Location Invariant Derived location invariant: (((((((((2 == x) && (y <= 4)) && ((((long long) 2 * y) + 1) <= (3 * ((89478484 + ((long long) y * 178956971)) / 268435456)))) || (((5 == x) && (y <= 32)) && (1 <= (((long long) 2 * y) + (3 * (((((long long) -1431655765 * y) + 715827872) >= 0) ? ((((long long) -1431655765 * y) + 715827872) / 2147483648) : (((((long long) -1431655765 * y) + 715827872) / 2147483648) - 1))))))) || (((3 == x) && (((long long) y + 1) <= (((((long long) y * 178956971) + 178956968) / 536870912) * 3))) && (y <= 8))) || (((y <= 2) && (x == 1)) && (((long long) y + 1) <= (((44739242 + ((long long) 44739243 * y)) / 134217728) * 3)))) || (((0 <= (((((long long) -1 * y) / 2) - 1) + 32)) && (1 <= ((3 * ((((((((long long) -1 * y) / 2) - 1) * 1431655765) + 715827872) >= 0) ? (((((((long long) -1 * y) / 2) - 1) * 1431655765) + 715827872) / 2147483648) : ((((((((long long) -1 * y) / 2) - 1) * 1431655765) + 715827872) / 2147483648) - 1))) + y))) && (6 == x))) || ((y == 1) && (x == 0))) || (((1 <= (y + ((((((long long) -357913941 * y) + 357913936) >= 0) ? ((((long long) -357913941 * y) + 357913936) / 1073741824) : (((((long long) -357913941 * y) + 357913936) / 1073741824) - 1)) * 3))) && (y <= 16)) && (x == 4))) RESULT: Ultimate proved your program to be correct! [2025-02-07 20:15:38,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE