./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci01-1.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/recursive/Fibonacci01-1.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 6b0570f2e0d80d68bc280040cce27f654b3fe7a2c0bad30f9bb811af9ca3d994 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:03:53,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:03:53,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:03:53,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:03:53,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:03:53,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:03:53,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:03:53,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:03:53,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:03:53,685 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:03:53,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:03:53,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:03:53,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:03:53,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:03:53,686 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:03:53,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:03:53,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:03:53,686 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:03:53,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:03:53,686 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:03:53,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:03:53,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:03:53,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:03:53,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:03:53,686 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:03:53,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:03:53,686 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:03:53,686 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:03:53,687 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:03:53,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:03:53,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:03:53,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:03:53,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:03:53,687 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:03:53,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:03:53,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:03:53,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:03:53,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:03:53,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:03:53,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:03:53,688 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:03:53,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:03:53,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:03:53,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:03:53,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:03:53,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:03:53,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:03:53,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:03:53,688 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 -> 6b0570f2e0d80d68bc280040cce27f654b3fe7a2c0bad30f9bb811af9ca3d994 [2025-01-09 04:03:53,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:03:53,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:03:53,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:03:53,995 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:03:53,995 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:03:53,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci01-1.c [2025-01-09 04:03:55,374 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f3a672b8/c1038b80b3684263953f7f9deb583032/FLAGf6ee059b3 [2025-01-09 04:03:55,640 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:03:55,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci01-1.c [2025-01-09 04:03:55,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f3a672b8/c1038b80b3684263953f7f9deb583032/FLAGf6ee059b3 [2025-01-09 04:03:55,664 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f3a672b8/c1038b80b3684263953f7f9deb583032 [2025-01-09 04:03:55,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:03:55,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:03:55,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:03:55,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:03:55,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:03:55,676 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:55" (1/1) ... [2025-01-09 04:03:55,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@592d7d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:55, skipping insertion in model container [2025-01-09 04:03:55,677 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:55" (1/1) ... [2025-01-09 04:03:55,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:03:55,829 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/recursive/Fibonacci01-1.c[804,817] [2025-01-09 04:03:55,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:03:55,842 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:03:55,852 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/recursive/Fibonacci01-1.c[804,817] [2025-01-09 04:03:55,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:03:55,865 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:03:55,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:55 WrapperNode [2025-01-09 04:03:55,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:03:55,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:03:55,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:03:55,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:03:55,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:55" (1/1) ... [2025-01-09 04:03:55,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:55" (1/1) ... [2025-01-09 04:03:55,893 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2025-01-09 04:03:55,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:03:55,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:03:55,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:03:55,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:03:55,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:55" (1/1) ... [2025-01-09 04:03:55,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:55" (1/1) ... [2025-01-09 04:03:55,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:55" (1/1) ... [2025-01-09 04:03:55,916 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 04:03:55,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:55" (1/1) ... [2025-01-09 04:03:55,916 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:55" (1/1) ... [2025-01-09 04:03:55,920 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:55" (1/1) ... [2025-01-09 04:03:55,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:55" (1/1) ... [2025-01-09 04:03:55,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:55" (1/1) ... [2025-01-09 04:03:55,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:55" (1/1) ... [2025-01-09 04:03:55,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:55" (1/1) ... [2025-01-09 04:03:55,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:03:55,932 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:03:55,932 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:03:55,932 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:03:55,933 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:55" (1/1) ... [2025-01-09 04:03:55,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:03:55,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:03:55,970 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 04:03:55,978 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 04:03:55,998 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-01-09 04:03:55,999 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-01-09 04:03:56,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:03:56,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:03:56,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:03:56,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:03:56,056 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:03:56,059 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:03:56,189 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-09 04:03:56,190 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:03:56,201 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:03:56,201 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:03:56,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:56 BoogieIcfgContainer [2025-01-09 04:03:56,202 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:03:56,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:03:56,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:03:56,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:03:56,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:03:55" (1/3) ... [2025-01-09 04:03:56,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ee8aef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:56, skipping insertion in model container [2025-01-09 04:03:56,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:55" (2/3) ... [2025-01-09 04:03:56,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ee8aef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:56, skipping insertion in model container [2025-01-09 04:03:56,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:56" (3/3) ... [2025-01-09 04:03:56,216 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2025-01-09 04:03:56,230 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:03:56,231 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci01-1.c that has 2 procedures, 20 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:03:56,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:03:56,304 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;@1c394956, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:03:56,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:03:56,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:03:56,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 04:03:56,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:56,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:56,316 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:56,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:56,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1939714822, now seen corresponding path program 1 times [2025-01-09 04:03:56,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:56,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834711845] [2025-01-09 04:03:56,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:56,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:56,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 04:03:56,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 04:03:56,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:56,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:56,689 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 04:03:56,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:56,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834711845] [2025-01-09 04:03:56,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834711845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:56,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:56,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:03:56,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96386176] [2025-01-09 04:03:56,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:56,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:03:56,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:56,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:03:56,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:03:56,715 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:03:56,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:56,836 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2025-01-09 04:03:56,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:03:56,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-01-09 04:03:56,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:56,847 INFO L225 Difference]: With dead ends: 31 [2025-01-09 04:03:56,848 INFO L226 Difference]: Without dead ends: 21 [2025-01-09 04:03:56,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:03:56,855 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:56,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 55 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:03:56,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-01-09 04:03:56,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-01-09 04:03:56,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 04:03:56,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-01-09 04:03:56,899 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2025-01-09 04:03:56,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:56,899 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-01-09 04:03:56,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:03:56,900 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-01-09 04:03:56,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 04:03:56,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:56,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:56,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:03:56,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:56,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:56,902 INFO L85 PathProgramCache]: Analyzing trace with hash 692912656, now seen corresponding path program 1 times [2025-01-09 04:03:56,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:56,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240774052] [2025-01-09 04:03:56,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:56,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:56,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 04:03:56,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 04:03:56,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:56,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:57,055 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 04:03:57,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:57,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240774052] [2025-01-09 04:03:57,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240774052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:57,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:57,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:03:57,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132781829] [2025-01-09 04:03:57,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:57,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:03:57,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:57,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:03:57,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:03:57,058 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:03:57,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:57,136 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-01-09 04:03:57,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:03:57,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-01-09 04:03:57,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:57,138 INFO L225 Difference]: With dead ends: 25 [2025-01-09 04:03:57,138 INFO L226 Difference]: Without dead ends: 21 [2025-01-09 04:03:57,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:03:57,139 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:57,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:03:57,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-01-09 04:03:57,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-01-09 04:03:57,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 04:03:57,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-01-09 04:03:57,145 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2025-01-09 04:03:57,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:57,145 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-01-09 04:03:57,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:03:57,146 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-01-09 04:03:57,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 04:03:57,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:57,147 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:57,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:03:57,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:57,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:57,148 INFO L85 PathProgramCache]: Analyzing trace with hash 453332055, now seen corresponding path program 1 times [2025-01-09 04:03:57,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:57,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969228022] [2025-01-09 04:03:57,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:57,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:57,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 04:03:57,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 04:03:57,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:57,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:03:57,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:57,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969228022] [2025-01-09 04:03:57,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969228022] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:03:57,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067872110] [2025-01-09 04:03:57,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:57,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:03:57,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:03:57,269 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 04:03:57,281 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 04:03:57,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 04:03:57,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 04:03:57,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:57,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:57,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 04:03:57,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:03:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:03:57,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:03:58,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:03:58,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067872110] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:03:58,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:03:58,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 20 [2025-01-09 04:03:58,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463223169] [2025-01-09 04:03:58,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:03:58,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 04:03:58,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:58,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 04:03:58,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:03:58,078 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-09 04:03:58,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:58,254 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2025-01-09 04:03:58,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:03:58,254 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 24 [2025-01-09 04:03:58,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:58,255 INFO L225 Difference]: With dead ends: 36 [2025-01-09 04:03:58,255 INFO L226 Difference]: Without dead ends: 21 [2025-01-09 04:03:58,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:03:58,256 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:58,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 134 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:03:58,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-01-09 04:03:58,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-01-09 04:03:58,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 04:03:58,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-01-09 04:03:58,261 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 24 [2025-01-09 04:03:58,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:58,261 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-01-09 04:03:58,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-09 04:03:58,261 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-01-09 04:03:58,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 04:03:58,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:58,262 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:58,270 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 04:03:58,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:03:58,466 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:58,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:58,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1064754479, now seen corresponding path program 1 times [2025-01-09 04:03:58,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:58,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854280314] [2025-01-09 04:03:58,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:58,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:58,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 04:03:58,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 04:03:58,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:58,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:58,660 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:03:58,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:58,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854280314] [2025-01-09 04:03:58,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854280314] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:03:58,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942151043] [2025-01-09 04:03:58,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:58,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:03:58,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:03:58,665 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 04:03:58,667 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 04:03:58,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 04:03:58,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 04:03:58,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:58,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:58,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 04:03:58,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:03:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:03:58,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:03:59,260 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:03:59,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942151043] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:03:59,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:03:59,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 21 [2025-01-09 04:03:59,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771550170] [2025-01-09 04:03:59,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:03:59,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 04:03:59,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:59,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 04:03:59,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:03:59,264 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-09 04:03:59,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:59,474 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2025-01-09 04:03:59,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:03:59,475 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 25 [2025-01-09 04:03:59,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:59,476 INFO L225 Difference]: With dead ends: 32 [2025-01-09 04:03:59,476 INFO L226 Difference]: Without dead ends: 28 [2025-01-09 04:03:59,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2025-01-09 04:03:59,477 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:59,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 81 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:03:59,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-09 04:03:59,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-01-09 04:03:59,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 04:03:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-01-09 04:03:59,484 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 25 [2025-01-09 04:03:59,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:59,484 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-01-09 04:03:59,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-09 04:03:59,485 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2025-01-09 04:03:59,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 04:03:59,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:59,486 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:59,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:03:59,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:03:59,687 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:59,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:59,687 INFO L85 PathProgramCache]: Analyzing trace with hash 484916750, now seen corresponding path program 2 times [2025-01-09 04:03:59,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:59,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276707574] [2025-01-09 04:03:59,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:03:59,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:59,694 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-09 04:03:59,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 04:03:59,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:03:59,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 04:03:59,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:59,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276707574] [2025-01-09 04:03:59,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276707574] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:03:59,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134589251] [2025-01-09 04:03:59,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:03:59,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:03:59,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:03:59,839 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 04:03:59,842 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 04:03:59,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-09 04:03:59,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 04:03:59,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:03:59,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:59,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 04:03:59,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:03:59,947 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 04:03:59,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:04:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 04:04:00,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134589251] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:04:00,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:04:00,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 15 [2025-01-09 04:04:00,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11633360] [2025-01-09 04:04:00,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:04:00,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 04:04:00,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:04:00,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 04:04:00,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:04:00,216 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-09 04:04:00,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:04:00,320 INFO L93 Difference]: Finished difference Result 53 states and 77 transitions. [2025-01-09 04:04:00,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:04:00,321 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) Word has length 38 [2025-01-09 04:04:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:04:00,322 INFO L225 Difference]: With dead ends: 53 [2025-01-09 04:04:00,322 INFO L226 Difference]: Without dead ends: 31 [2025-01-09 04:04:00,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:04:00,323 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:04:00,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 89 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:04:00,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-09 04:04:00,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2025-01-09 04:04:00,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 04:04:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2025-01-09 04:04:00,330 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 38 [2025-01-09 04:04:00,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:04:00,331 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-01-09 04:04:00,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-09 04:04:00,331 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2025-01-09 04:04:00,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 04:04:00,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:04:00,332 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:04:00,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 04:04:00,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:00,536 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:04:00,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:04:00,537 INFO L85 PathProgramCache]: Analyzing trace with hash 837439950, now seen corresponding path program 3 times [2025-01-09 04:04:00,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:04:00,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109311763] [2025-01-09 04:04:00,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:04:00,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:04:00,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-01-09 04:04:00,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 39 statements. [2025-01-09 04:04:00,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 04:04:00,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 04:04:00,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:04:00,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109311763] [2025-01-09 04:04:00,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109311763] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:04:00,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231641270] [2025-01-09 04:04:00,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:04:00,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:00,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:04:00,874 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 04:04:00,876 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 04:04:00,911 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-01-09 04:04:00,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 39 statements. [2025-01-09 04:04:00,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 04:04:00,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:00,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 04:04:00,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:04:01,131 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 04:04:01,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:04:01,708 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 04:04:01,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231641270] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:04:01,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:04:01,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 29 [2025-01-09 04:04:01,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124994849] [2025-01-09 04:04:01,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:04:01,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 04:04:01,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:04:01,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 04:04:01,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2025-01-09 04:04:01,712 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 29 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 21 states have internal predecessors, (47), 8 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2025-01-09 04:04:02,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:04:02,032 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2025-01-09 04:04:02,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:04:02,033 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 21 states have internal predecessors, (47), 8 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) Word has length 39 [2025-01-09 04:04:02,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:04:02,035 INFO L225 Difference]: With dead ends: 45 [2025-01-09 04:04:02,036 INFO L226 Difference]: Without dead ends: 41 [2025-01-09 04:04:02,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=1313, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 04:04:02,037 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:04:02,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 156 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:04:02,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-09 04:04:02,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2025-01-09 04:04:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 04:04:02,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2025-01-09 04:04:02,049 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 39 [2025-01-09 04:04:02,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:04:02,049 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2025-01-09 04:04:02,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 21 states have internal predecessors, (47), 8 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2025-01-09 04:04:02,049 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2025-01-09 04:04:02,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 04:04:02,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:04:02,050 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:04:02,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 04:04:02,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-09 04:04:02,251 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:04:02,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:04:02,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1076051815, now seen corresponding path program 4 times [2025-01-09 04:04:02,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:04:02,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97865934] [2025-01-09 04:04:02,252 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 04:04:02,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:04:02,257 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-01-09 04:04:02,261 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 43 of 53 statements. [2025-01-09 04:04:02,261 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 04:04:02,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 30 proven. 31 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 04:04:02,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:04:02,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97865934] [2025-01-09 04:04:02,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97865934] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:04:02,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028988406] [2025-01-09 04:04:02,308 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 04:04:02,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:02,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:04:02,313 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 04:04:02,315 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 04:04:02,345 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-01-09 04:04:02,356 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 43 of 53 statements. [2025-01-09 04:04:02,356 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 04:04:02,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:02,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 04:04:02,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:04:02,385 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 30 proven. 31 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 04:04:02,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:04:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 30 proven. 31 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 04:04:02,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028988406] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:04:02,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:04:02,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-01-09 04:04:02,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209501040] [2025-01-09 04:04:02,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:04:02,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:04:02,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:04:02,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:04:02,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:04:02,552 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:04:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:04:02,645 INFO L93 Difference]: Finished difference Result 61 states and 89 transitions. [2025-01-09 04:04:02,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:04:02,645 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2025-01-09 04:04:02,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:04:02,646 INFO L225 Difference]: With dead ends: 61 [2025-01-09 04:04:02,646 INFO L226 Difference]: Without dead ends: 33 [2025-01-09 04:04:02,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:04:02,647 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:04:02,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 46 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:04:02,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-09 04:04:02,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2025-01-09 04:04:02,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 04:04:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2025-01-09 04:04:02,656 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 53 [2025-01-09 04:04:02,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:04:02,656 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-01-09 04:04:02,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:04:02,657 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2025-01-09 04:04:02,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:04:02,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:04:02,661 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:04:02,668 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 04:04:02,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:02,861 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:04:02,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:04:02,862 INFO L85 PathProgramCache]: Analyzing trace with hash -2015646778, now seen corresponding path program 5 times [2025-01-09 04:04:02,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:04:02,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088653504] [2025-01-09 04:04:02,862 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 04:04:02,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:04:02,870 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 66 statements into 9 equivalence classes. [2025-01-09 04:04:02,876 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 28 of 66 statements. [2025-01-09 04:04:02,878 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-01-09 04:04:02,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:02,983 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 46 proven. 60 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-01-09 04:04:02,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:04:02,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088653504] [2025-01-09 04:04:02,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088653504] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:04:02,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485248426] [2025-01-09 04:04:02,983 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 04:04:02,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:02,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:04:02,985 INFO L229 MonitoredProcess]: Starting monitored process 7 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 04:04:02,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 04:04:03,016 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 66 statements into 9 equivalence classes. [2025-01-09 04:04:03,024 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 28 of 66 statements. [2025-01-09 04:04:03,024 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-01-09 04:04:03,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:03,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 04:04:03,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:04:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 53 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 04:04:03,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:04:03,476 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 53 proven. 75 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-09 04:04:03,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485248426] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:04:03,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:04:03,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 17 [2025-01-09 04:04:03,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249335355] [2025-01-09 04:04:03,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:04:03,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 04:04:03,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:04:03,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 04:04:03,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-01-09 04:04:03,477 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 10 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) [2025-01-09 04:04:03,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:04:03,632 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2025-01-09 04:04:03,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:04:03,633 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 10 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) Word has length 66 [2025-01-09 04:04:03,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:04:03,634 INFO L225 Difference]: With dead ends: 64 [2025-01-09 04:04:03,634 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 04:04:03,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 121 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2025-01-09 04:04:03,635 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 47 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:04:03,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 103 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:04:03,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 04:04:03,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-01-09 04:04:03,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2025-01-09 04:04:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2025-01-09 04:04:03,648 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 66 [2025-01-09 04:04:03,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:04:03,648 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2025-01-09 04:04:03,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 10 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) [2025-01-09 04:04:03,648 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2025-01-09 04:04:03,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:04:03,649 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:04:03,649 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:04:03,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 04:04:03,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 04:04:03,850 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:04:03,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:04:03,850 INFO L85 PathProgramCache]: Analyzing trace with hash 135755334, now seen corresponding path program 6 times [2025-01-09 04:04:03,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:04:03,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459738833] [2025-01-09 04:04:03,850 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 04:04:03,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:04:03,854 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 66 statements into 8 equivalence classes. [2025-01-09 04:04:03,873 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:04:03,873 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-01-09 04:04:03,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:04,256 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 102 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-01-09 04:04:04,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:04:04,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459738833] [2025-01-09 04:04:04,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459738833] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:04:04,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031014470] [2025-01-09 04:04:04,256 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 04:04:04,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:04,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:04:04,261 INFO L229 MonitoredProcess]: Starting monitored process 8 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 04:04:04,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 04:04:04,301 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 66 statements into 8 equivalence classes. [2025-01-09 04:04:04,328 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:04:04,328 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-01-09 04:04:04,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:04,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 04:04:04,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:04:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 04:04:04,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:04:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 26 proven. 88 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-09 04:04:05,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031014470] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:04:05,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:04:05,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 18] total 35 [2025-01-09 04:04:05,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238988540] [2025-01-09 04:04:05,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:04:05,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 04:04:05,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:04:05,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 04:04:05,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 04:04:05,849 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 35 states, 35 states have (on average 1.6) internal successors, (56), 25 states have internal predecessors, (56), 12 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (18), 17 states have call predecessors, (18), 12 states have call successors, (18) [2025-01-09 04:04:06,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:04:06,318 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2025-01-09 04:04:06,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 04:04:06,318 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6) internal successors, (56), 25 states have internal predecessors, (56), 12 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (18), 17 states have call predecessors, (18), 12 states have call successors, (18) Word has length 66 [2025-01-09 04:04:06,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:04:06,319 INFO L225 Difference]: With dead ends: 52 [2025-01-09 04:04:06,319 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 04:04:06,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 109 SyntacticMatches, 12 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=500, Invalid=2470, Unknown=0, NotChecked=0, Total=2970 [2025-01-09 04:04:06,321 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:04:06,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 156 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:04:06,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 04:04:06,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 04:04:06,321 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 04:04:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 04:04:06,322 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2025-01-09 04:04:06,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:04:06,322 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 04:04:06,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.6) internal successors, (56), 25 states have internal predecessors, (56), 12 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (18), 17 states have call predecessors, (18), 12 states have call successors, (18) [2025-01-09 04:04:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 04:04:06,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 04:04:06,324 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:04:06,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 04:04:06,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:06,528 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2025-01-09 04:04:06,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 04:04:06,944 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:04:06,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:04:06 BoogieIcfgContainer [2025-01-09 04:04:06,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:04:06,950 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:04:06,950 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:04:06,950 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:04:06,951 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:56" (3/4) ... [2025-01-09 04:04:06,953 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 04:04:06,958 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2025-01-09 04:04:06,962 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-09 04:04:06,962 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 04:04:06,962 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 04:04:06,962 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:04:07,033 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:04:07,034 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:04:07,034 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:04:07,035 INFO L158 Benchmark]: Toolchain (without parser) took 11366.45ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 106.3MB in the beginning and 75.0MB in the end (delta: 31.2MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. [2025-01-09 04:04:07,035 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:04:07,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.11ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 95.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:04:07,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.14ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 94.5MB in the end (delta: 951.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:04:07,036 INFO L158 Benchmark]: Boogie Preprocessor took 35.94ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 92.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:04:07,036 INFO L158 Benchmark]: RCFGBuilder took 270.44ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 82.5MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:04:07,036 INFO L158 Benchmark]: TraceAbstraction took 10745.25ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 82.5MB in the beginning and 81.5MB in the end (delta: 1.0MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. [2025-01-09 04:04:07,036 INFO L158 Benchmark]: Witness Printer took 83.93ms. Allocated memory is still 176.2MB. Free memory was 81.5MB in the beginning and 75.0MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:04:07,038 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.84ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.11ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 95.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.14ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 94.5MB in the end (delta: 951.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.94ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 92.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 270.44ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 82.5MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10745.25ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 82.5MB in the beginning and 81.5MB in the end (delta: 1.0MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. * Witness Printer took 83.93ms. Allocated memory is still 176.2MB. Free memory was 81.5MB in the beginning and 75.0MB 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: 36]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 9, TraceHistogramMax: 9, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 873 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 740 mSDsCounter, 202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1425 IncrementalHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 202 mSolverCounterUnsat, 133 mSDtfsCounter, 1425 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 763 GetRequests, 533 SyntacticMatches, 34 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1853 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=8, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 24 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 645 NumberOfCodeBlocks, 533 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 933 ConstructedInterpolants, 0 QuantifiedInterpolants, 2516 SizeOfPredicates, 11 NumberOfNonLiveVariables, 657 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 1148/1833 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 RESULT: Ultimate proved your program to be correct! [2025-01-09 04:04:07,059 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