./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/sum_by_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/loops-crafted-1/sum_by_3.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 cbdeb806056afbf44cc985ff91f53f00e848d18cfefb92d1f6744eb19cf6d91b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:05:04,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:05:04,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:05:04,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:05:04,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:05:04,443 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:05:04,443 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:05:04,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:05:04,444 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:05:04,444 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:05:04,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:05:04,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:05:04,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:05:04,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:05:04,445 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:05:04,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:05:04,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:05:04,445 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:05:04,445 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:05:04,445 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:05:04,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:05:04,446 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:05:04,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:05:04,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:05:04,446 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:05:04,446 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:05:04,446 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:05:04,446 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:05:04,446 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:05:04,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:05:04,447 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:05:04,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:05:04,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:05:04,447 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:05:04,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:05:04,447 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:05:04,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:05:04,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:05:04,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:05:04,447 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:05:04,447 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:05:04,447 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:05:04,448 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:05:04,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:05:04,448 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:05:04,448 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:05:04,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:05:04,448 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:05:04,448 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 -> cbdeb806056afbf44cc985ff91f53f00e848d18cfefb92d1f6744eb19cf6d91b [2025-01-09 03:05:04,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:05:04,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:05:04,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:05:04,672 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:05:04,673 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:05:04,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/sum_by_3.c [2025-01-09 03:05:05,748 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9745b44b/095654d764684bdbb408eeb02cfd5ad2/FLAG3266b48ee [2025-01-09 03:05:05,969 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:05:05,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sum_by_3.c [2025-01-09 03:05:05,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9745b44b/095654d764684bdbb408eeb02cfd5ad2/FLAG3266b48ee [2025-01-09 03:05:05,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9745b44b/095654d764684bdbb408eeb02cfd5ad2 [2025-01-09 03:05:05,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:05:05,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:05:05,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:05:05,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:05:05,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:05:05,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:05:05" (1/1) ... [2025-01-09 03:05:05,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d12d3a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:05, skipping insertion in model container [2025-01-09 03:05:05,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:05:05" (1/1) ... [2025-01-09 03:05:06,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:05:06,102 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/loops-crafted-1/sum_by_3.c[406,419] [2025-01-09 03:05:06,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:05:06,123 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:05:06,131 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/loops-crafted-1/sum_by_3.c[406,419] [2025-01-09 03:05:06,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:05:06,147 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:05:06,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:06 WrapperNode [2025-01-09 03:05:06,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:05:06,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:05:06,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:05:06,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:05:06,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:06" (1/1) ... [2025-01-09 03:05:06,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:06" (1/1) ... [2025-01-09 03:05:06,172 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 37 [2025-01-09 03:05:06,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:05:06,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:05:06,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:05:06,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:05:06,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:06" (1/1) ... [2025-01-09 03:05:06,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:06" (1/1) ... [2025-01-09 03:05:06,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:06" (1/1) ... [2025-01-09 03:05:06,186 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-01-09 03:05:06,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:06" (1/1) ... [2025-01-09 03:05:06,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:06" (1/1) ... [2025-01-09 03:05:06,188 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:06" (1/1) ... [2025-01-09 03:05:06,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:06" (1/1) ... [2025-01-09 03:05:06,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:06" (1/1) ... [2025-01-09 03:05:06,190 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:06" (1/1) ... [2025-01-09 03:05:06,190 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:06" (1/1) ... [2025-01-09 03:05:06,191 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:05:06,191 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:05:06,191 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:05:06,192 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:05:06,192 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:06" (1/1) ... [2025-01-09 03:05:06,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:05:06,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:05:06,215 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-01-09 03:05:06,217 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-01-09 03:05:06,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:05:06,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:05:06,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:05:06,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:05:06,273 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:05:06,275 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:05:06,358 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 03:05:06,358 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:05:06,366 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:05:06,366 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 03:05:06,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:05:06 BoogieIcfgContainer [2025-01-09 03:05:06,366 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:05:06,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:05:06,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:05:06,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:05:06,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:05:05" (1/3) ... [2025-01-09 03:05:06,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14191b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:05:06, skipping insertion in model container [2025-01-09 03:05:06,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:06" (2/3) ... [2025-01-09 03:05:06,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14191b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:05:06, skipping insertion in model container [2025-01-09 03:05:06,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:05:06" (3/3) ... [2025-01-09 03:05:06,372 INFO L128 eAbstractionObserver]: Analyzing ICFG sum_by_3.c [2025-01-09 03:05:06,381 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:05:06,382 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sum_by_3.c that has 1 procedures, 13 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 03:05:06,415 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:05:06,422 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;@15a68486, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:05:06,422 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:05:06,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 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-01-09 03:05:06,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 03:05:06,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:06,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:06,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:06,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:06,431 INFO L85 PathProgramCache]: Analyzing trace with hash 180553681, now seen corresponding path program 1 times [2025-01-09 03:05:06,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:06,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156723483] [2025-01-09 03:05:06,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:06,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:06,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 03:05:06,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 03:05:06,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:06,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:07,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:07,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:07,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156723483] [2025-01-09 03:05:07,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156723483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:05:07,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:05:07,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:05:07,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875688029] [2025-01-09 03:05:07,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:05:07,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:05:07,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:07,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:05:07,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:05:07,121 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 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 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-01-09 03:05:07,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:07,229 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2025-01-09 03:05:07,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:05:07,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-01-09 03:05:07,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:07,236 INFO L225 Difference]: With dead ends: 26 [2025-01-09 03:05:07,236 INFO L226 Difference]: Without dead ends: 15 [2025-01-09 03:05:07,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:05:07,241 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 28 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:07,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 20 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:05:07,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-09 03:05:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2025-01-09 03:05:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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-01-09 03:05:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2025-01-09 03:05:07,265 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 8 [2025-01-09 03:05:07,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:07,265 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-01-09 03:05:07,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-01-09 03:05:07,266 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2025-01-09 03:05:07,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 03:05:07,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:07,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:07,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:05:07,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:07,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:07,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1239215726, now seen corresponding path program 1 times [2025-01-09 03:05:07,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:07,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265944604] [2025-01-09 03:05:07,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:07,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:07,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 03:05:07,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 03:05:07,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:07,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:08,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:08,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265944604] [2025-01-09 03:05:08,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265944604] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:05:08,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008408305] [2025-01-09 03:05:08,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:08,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:05:08,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:05:08,093 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-01-09 03:05:08,094 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-01-09 03:05:08,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 03:05:08,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 03:05:08,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:08,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:08,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 03:05:08,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:05:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:08,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:05:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:16,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008408305] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:05:16,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:05:16,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-01-09 03:05:16,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618705581] [2025-01-09 03:05:16,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:05:16,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 03:05:16,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:16,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 03:05:16,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=221, Unknown=2, NotChecked=0, Total=272 [2025-01-09 03:05:16,609 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-01-09 03:05:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:17,519 INFO L93 Difference]: Finished difference Result 30 states and 48 transitions. [2025-01-09 03:05:17,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 03:05:17,522 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 9 [2025-01-09 03:05:17,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:17,523 INFO L225 Difference]: With dead ends: 30 [2025-01-09 03:05:17,523 INFO L226 Difference]: Without dead ends: 18 [2025-01-09 03:05:17,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=226, Invalid=764, Unknown=2, NotChecked=0, Total=992 [2025-01-09 03:05:17,524 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 87 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:17,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 24 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:05:17,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-01-09 03:05:17,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2025-01-09 03:05:17,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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-01-09 03:05:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2025-01-09 03:05:17,536 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 9 [2025-01-09 03:05:17,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:17,536 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-01-09 03:05:17,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-01-09 03:05:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2025-01-09 03:05:17,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 03:05:17,537 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:17,537 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:17,544 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-01-09 03:05:17,738 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-01-09 03:05:17,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:17,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:17,739 INFO L85 PathProgramCache]: Analyzing trace with hash -774070768, now seen corresponding path program 1 times [2025-01-09 03:05:17,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:17,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645870226] [2025-01-09 03:05:17,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:17,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:17,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 03:05:17,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 03:05:17,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:17,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:17,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:17,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645870226] [2025-01-09 03:05:17,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645870226] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:05:17,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32875829] [2025-01-09 03:05:17,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:17,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:05:17,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:05:17,874 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-01-09 03:05:17,875 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-01-09 03:05:17,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 03:05:17,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 03:05:17,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:17,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:17,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 03:05:17,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:05:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:17,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:05:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:05:17,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32875829] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 03:05:17,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:05:17,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 6] total 9 [2025-01-09 03:05:17,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217681029] [2025-01-09 03:05:17,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:05:17,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:05:17,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:17,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:05:17,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:05:17,984 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-01-09 03:05:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:17,998 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2025-01-09 03:05:17,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:05:17,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 11 [2025-01-09 03:05:17,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:17,999 INFO L225 Difference]: With dead ends: 20 [2025-01-09 03:05:17,999 INFO L226 Difference]: Without dead ends: 15 [2025-01-09 03:05:17,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:05:18,000 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:18,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:05:18,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-09 03:05:18,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-01-09 03:05:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-01-09 03:05:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2025-01-09 03:05:18,006 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 11 [2025-01-09 03:05:18,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:18,006 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-01-09 03:05:18,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-01-09 03:05:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2025-01-09 03:05:18,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 03:05:18,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:18,007 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:18,012 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-01-09 03:05:18,207 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-01-09 03:05:18,208 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:18,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:18,208 INFO L85 PathProgramCache]: Analyzing trace with hash -772104562, now seen corresponding path program 1 times [2025-01-09 03:05:18,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:18,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430562605] [2025-01-09 03:05:18,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:18,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:18,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 03:05:18,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 03:05:18,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:18,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:18,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:18,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:18,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430562605] [2025-01-09 03:05:18,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430562605] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:05:18,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799728948] [2025-01-09 03:05:18,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:18,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:05:18,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:05:18,350 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-01-09 03:05:18,352 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-01-09 03:05:18,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 03:05:18,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 03:05:18,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:18,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:18,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 03:05:18,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:05:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:05:18,389 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:05:18,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799728948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:05:18,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:05:18,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-09 03:05:18,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535993786] [2025-01-09 03:05:18,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:05:18,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:05:18,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:18,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:05:18,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:05:18,391 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-01-09 03:05:18,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:18,403 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2025-01-09 03:05:18,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:05:18,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 11 [2025-01-09 03:05:18,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:18,404 INFO L225 Difference]: With dead ends: 19 [2025-01-09 03:05:18,404 INFO L226 Difference]: Without dead ends: 13 [2025-01-09 03:05:18,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:05:18,405 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:18,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:05:18,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-01-09 03:05:18,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-01-09 03:05:18,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-01-09 03:05:18,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2025-01-09 03:05:18,411 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2025-01-09 03:05:18,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:18,411 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2025-01-09 03:05:18,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-01-09 03:05:18,411 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2025-01-09 03:05:18,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 03:05:18,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:18,412 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:18,418 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-01-09 03:05:18,616 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-01-09 03:05:18,616 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:18,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:18,616 INFO L85 PathProgramCache]: Analyzing trace with hash -178895087, now seen corresponding path program 2 times [2025-01-09 03:05:18,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:18,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263170748] [2025-01-09 03:05:18,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:05:18,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:18,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-09 03:05:18,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 03:05:18,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:05:18,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:19,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:19,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263170748] [2025-01-09 03:05:19,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263170748] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:05:19,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959600245] [2025-01-09 03:05:19,106 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:05:19,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:05:19,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:05:19,110 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-01-09 03:05:19,112 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-01-09 03:05:19,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-09 03:05:19,150 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 03:05:19,150 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:05:19,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:19,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 03:05:19,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:05:19,408 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:19,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:05:19,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:19,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959600245] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:05:19,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:05:19,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2025-01-09 03:05:19,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642875797] [2025-01-09 03:05:19,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:05:19,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 03:05:19,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:19,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 03:05:19,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2025-01-09 03:05:19,934 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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-01-09 03:05:30,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:30,338 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2025-01-09 03:05:30,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 03:05:30,338 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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 12 [2025-01-09 03:05:30,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:30,338 INFO L225 Difference]: With dead ends: 26 [2025-01-09 03:05:30,338 INFO L226 Difference]: Without dead ends: 19 [2025-01-09 03:05:30,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=330, Invalid=1392, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 03:05:30,340 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 57 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:30,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 23 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 03:05:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-01-09 03:05:30,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-01-09 03:05:30,345 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-01-09 03:05:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2025-01-09 03:05:30,345 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 12 [2025-01-09 03:05:30,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:30,345 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2025-01-09 03:05:30,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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-01-09 03:05:30,345 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2025-01-09 03:05:30,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 03:05:30,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:30,346 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:30,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:05:30,546 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-01-09 03:05:30,546 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:30,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:30,547 INFO L85 PathProgramCache]: Analyzing trace with hash -751363599, now seen corresponding path program 3 times [2025-01-09 03:05:30,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:30,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303927107] [2025-01-09 03:05:30,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:05:30,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:30,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 6 equivalence classes. [2025-01-09 03:05:30,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 18 statements. [2025-01-09 03:05:30,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:05:30,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:05:30,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:30,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303927107] [2025-01-09 03:05:30,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303927107] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:05:30,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877843037] [2025-01-09 03:05:30,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:05:30,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:05:30,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:05:30,998 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:05:30,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:05:31,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 6 equivalence classes. [2025-01-09 03:05:31,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 18 statements. [2025-01-09 03:05:31,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:05:31,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:31,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 03:05:31,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:05:31,400 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 03:05:31,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:05:37,112 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 03:05:37,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877843037] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:05:37,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:05:37,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2025-01-09 03:05:37,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672789147] [2025-01-09 03:05:37,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:05:37,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 03:05:37,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:37,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 03:05:37,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-01-09 03:05:37,113 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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-01-09 03:05:37,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:37,407 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2025-01-09 03:05:37,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:05:37,407 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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-01-09 03:05:37,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:37,408 INFO L225 Difference]: With dead ends: 19 [2025-01-09 03:05:37,408 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 03:05:37,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-01-09 03:05:37,408 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:37,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 6 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:05:37,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 03:05:37,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 03:05:37,410 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-01-09 03:05:37,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 03:05:37,410 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2025-01-09 03:05:37,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:37,410 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 03:05:37,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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-01-09 03:05:37,410 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 03:05:37,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 03:05:37,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 03:05:37,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:05:37,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:05:37,616 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-01-09 03:05:37,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 03:05:45,754 WARN L286 SmtUtils]: Spent 5.10s on a formula simplification. DAG size of input: 109 DAG size of output: 53 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-01-09 03:05:45,867 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 03:05:45,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:05:45 BoogieIcfgContainer [2025-01-09 03:05:45,880 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 03:05:45,880 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 03:05:45,880 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 03:05:45,880 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 03:05:45,881 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:05:06" (3/4) ... [2025-01-09 03:05:45,884 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 03:05:45,889 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-01-09 03:05:45,890 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 03:05:45,890 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 03:05:45,890 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 03:05:45,949 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 03:05:45,949 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 03:05:45,949 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 03:05:45,950 INFO L158 Benchmark]: Toolchain (without parser) took 39956.71ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 112.6MB in the beginning and 129.7MB in the end (delta: -17.1MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2025-01-09 03:05:45,950 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:05:45,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.99ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 101.7MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:05:45,950 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.00ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:05:45,950 INFO L158 Benchmark]: Boogie Preprocessor took 17.28ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 99.4MB in the end (delta: 924.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:05:45,951 INFO L158 Benchmark]: RCFGBuilder took 175.07ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 89.0MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 03:05:45,951 INFO L158 Benchmark]: TraceAbstraction took 39511.88ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 88.5MB in the beginning and 136.1MB in the end (delta: -47.6MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. [2025-01-09 03:05:45,951 INFO L158 Benchmark]: Witness Printer took 69.09ms. Allocated memory is still 176.2MB. Free memory was 136.1MB in the beginning and 129.7MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:05:45,952 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.99ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 101.7MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.00ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.28ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 99.4MB in the end (delta: 924.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 175.07ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 89.0MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 39511.88ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 88.5MB in the beginning and 136.1MB in the end (delta: -47.6MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. * Witness Printer took 69.09ms. Allocated memory is still 176.2MB. Free memory was 136.1MB in the beginning and 129.7MB in the end (delta: 6.5MB). 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: 10]: 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, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.2s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 416 IncrementalHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 32 mSDtfsCounter, 416 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 23.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=5, InterpolantAutomatonStates: 58, 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, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 130 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 165 ConstructedInterpolants, 10 QuantifiedInterpolants, 2440 SizeOfPredicates, 12 NumberOfNonLiveVariables, 244 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 137/218 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: 25]: Loop Invariant Derived loop invariant: ((((((i == 0) && (n <= 20000001)) && (SIZE == 20000001)) && ((((unsigned) ((j >= 0) ? (j % 2147483648) : ((j % 2147483648) + 2147483648)) * 2) / 3) <= 20000001)) || ((((n <= 20000001) && (i == 1)) && (((((((long long) 2 * j) + 1) >= 0) ? ((((long long) 2 * j) + 1) % 4294967296) : (((((long long) 2 * j) + 1) % 4294967296) + 4294967296)) / 3) <= 20000001)) && (SIZE == 20000001))) || (((((((n < ((long long) i + 1)) || ((((3 + ((long long) 3 * i)) % 4294967296) / 3) < 20000002)) || ((((long long) i + 1) % 4294967296) < n)) && ((((((long long) 3 * i) % 4294967296) / 3) < 20000002) || (i < n))) && (((((((long long) 2 * j) + i) >= 0) ? ((((long long) 2 * j) + i) % 4294967296) : (((((long long) 2 * j) + i) % 4294967296) + 4294967296)) / 3) <= 20000001)) && (SIZE == 20000001)) && (n <= ((j >= 0) ? (j % 4294967296) : ((j % 4294967296) + 4294967296))))) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((n <= k) && (((((((long long) i + j) + k) >= 0) ? ((((long long) i + j) + k) % 4294967296) : (((((long long) i + j) + k) % 4294967296) + 4294967296)) / 3) <= 20000001)) && (((n < ((long long) i + 1)) || ((((3 + ((long long) 3 * i)) % 4294967296) / 3) < 20000002)) || ((((long long) i + 1) % 4294967296) < n))) && ((((((long long) 3 * i) % 4294967296) / 3) < 20000002) || (i < n))) && (((((((long long) 2 * j) + i) >= 0) ? ((((long long) 2 * j) + i) % 4294967296) : (((((long long) 2 * j) + i) % 4294967296) + 4294967296)) / 3) <= 20000001)) && (SIZE == 20000001)) && (n <= ((j >= 0) ? (j % 4294967296) : ((j % 4294967296) + 4294967296)))) || (((((i == 0) && (n <= 20000001)) && ((((((long long) j + k) >= 0) ? (((long long) j + k) % 4294967296) : ((((long long) j + k) % 4294967296) + 4294967296)) / 3) <= 20000001)) && (SIZE == 20000001)) && ((((unsigned) ((j >= 0) ? (j % 2147483648) : ((j % 2147483648) + 2147483648)) * 2) / 3) <= 20000001))) || (((((((((((long long) j + k) + 1) >= 0) ? ((((long long) j + k) + 1) % 4294967296) : (((((long long) j + k) + 1) % 4294967296) + 4294967296)) / 3) <= 20000001) && (n <= 20000001)) && (i == 1)) && (((((((long long) 2 * j) + 1) >= 0) ? ((((long long) 2 * j) + 1) % 4294967296) : (((((long long) 2 * j) + 1) % 4294967296) + 4294967296)) / 3) <= 20000001)) && (SIZE == 20000001))) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((((1 <= n) && (SIZE == 20000001)) && (((4294967295 + i) % 4294967296) <= 20000000)) && (0 <= (((((long long) -1 * n) + 20000001) >= 0) ? ((((long long) -1 * n) + 20000001) / 4294967296) : (((((long long) -1 * n) + 20000001) / 4294967296) - 1)))) || (((i == 0) && (n <= 20000001)) && (SIZE == 20000001))) RESULT: Ultimate proved your program to be correct! [2025-01-09 03:05:45,974 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