./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/hh2012-ex3.i --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/loop-lit/hh2012-ex3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c7177334f88b94ca4ee99044935e396702561856a6f48616f98f91aafc609bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:59:05,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:59:05,829 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:59:05,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:59:05,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:59:05,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:59:05,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:59:05,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:59:05,851 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:59:05,851 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:59:05,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:59:05,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:59:05,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:59:05,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:59:05,852 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:59:05,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:59:05,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:59:05,852 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:59:05,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:59:05,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:59:05,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:59:05,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:59:05,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:59:05,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:59:05,852 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:59:05,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:59:05,853 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:59:05,853 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:59:05,853 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:59:05,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:59:05,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:59:05,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:59:05,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:59:05,853 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:59:05,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:59:05,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:59:05,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:59:05,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:59:05,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:59:05,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:59:05,855 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:59:05,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:59:05,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:59:05,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:59:05,855 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:59:05,855 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:59:05,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:59:05,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:59:05,855 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 -> 3c7177334f88b94ca4ee99044935e396702561856a6f48616f98f91aafc609bb [2025-01-09 02:59:06,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:59:06,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:59:06,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:59:06,076 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:59:06,076 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:59:06,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/hh2012-ex3.i [2025-01-09 02:59:07,166 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b24c1ab09/a3881eaf1f8241dcb82a1c9c3fdd9da0/FLAG84cd97c02 [2025-01-09 02:59:07,388 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:59:07,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex3.i [2025-01-09 02:59:07,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b24c1ab09/a3881eaf1f8241dcb82a1c9c3fdd9da0/FLAG84cd97c02 [2025-01-09 02:59:07,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b24c1ab09/a3881eaf1f8241dcb82a1c9c3fdd9da0 [2025-01-09 02:59:07,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:59:07,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:59:07,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:59:07,438 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:59:07,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:59:07,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:59:07" (1/1) ... [2025-01-09 02:59:07,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c64e84d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:59:07, skipping insertion in model container [2025-01-09 02:59:07,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:59:07" (1/1) ... [2025-01-09 02:59:07,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:59:07,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex3.i[799,812] [2025-01-09 02:59:07,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:59:07,574 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:59:07,585 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex3.i[799,812] [2025-01-09 02:59:07,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:59:07,597 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:59:07,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:59:07 WrapperNode [2025-01-09 02:59:07,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:59:07,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:59:07,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:59:07,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:59:07,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:59:07" (1/1) ... [2025-01-09 02:59:07,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:59:07" (1/1) ... [2025-01-09 02:59:07,621 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2025-01-09 02:59:07,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:59:07,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:59:07,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:59:07,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:59:07,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:59:07" (1/1) ... [2025-01-09 02:59:07,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:59:07" (1/1) ... [2025-01-09 02:59:07,629 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:59:07" (1/1) ... [2025-01-09 02:59:07,638 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 02:59:07,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:59:07" (1/1) ... [2025-01-09 02:59:07,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:59:07" (1/1) ... [2025-01-09 02:59:07,642 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:59:07" (1/1) ... [2025-01-09 02:59:07,643 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:59:07" (1/1) ... [2025-01-09 02:59:07,645 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:59:07" (1/1) ... [2025-01-09 02:59:07,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:59:07" (1/1) ... [2025-01-09 02:59:07,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:59:07" (1/1) ... [2025-01-09 02:59:07,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:59:07,650 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:59:07,650 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:59:07,650 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:59:07,651 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:59:07" (1/1) ... [2025-01-09 02:59:07,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:59:07,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:59:07,680 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 02:59:07,686 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 02:59:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:59:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:59:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:59:07,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:59:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 02:59:07,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 02:59:07,745 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:59:07,747 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:59:07,829 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-01-09 02:59:07,830 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:59:07,837 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:59:07,839 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 02:59:07,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:59:07 BoogieIcfgContainer [2025-01-09 02:59:07,840 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:59:07,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:59:07,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:59:07,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:59:07,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:59:07" (1/3) ... [2025-01-09 02:59:07,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9dfb41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:59:07, skipping insertion in model container [2025-01-09 02:59:07,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:59:07" (2/3) ... [2025-01-09 02:59:07,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9dfb41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:59:07, skipping insertion in model container [2025-01-09 02:59:07,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:59:07" (3/3) ... [2025-01-09 02:59:07,848 INFO L128 eAbstractionObserver]: Analyzing ICFG hh2012-ex3.i [2025-01-09 02:59:07,859 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:59:07,863 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hh2012-ex3.i that has 2 procedures, 22 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 02:59:07,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:59:07,910 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;@6d081bf3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:59:07,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:59:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 02:59:07,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 02:59:07,917 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:59:07,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:59:07,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:59:07,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:59:07,921 INFO L85 PathProgramCache]: Analyzing trace with hash 155501436, now seen corresponding path program 1 times [2025-01-09 02:59:07,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:59:07,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866894482] [2025-01-09 02:59:07,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:59:07,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:59:07,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 02:59:07,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 02:59:07,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:59:07,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:59:08,054 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 02:59:08,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:59:08,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866894482] [2025-01-09 02:59:08,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866894482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:59:08,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:59:08,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:59:08,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468435272] [2025-01-09 02:59:08,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:59:08,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:59:08,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:59:08,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:59:08,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:59:08,075 INFO L87 Difference]: Start difference. First operand has 22 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:08,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:59:08,108 INFO L93 Difference]: Finished difference Result 43 states and 70 transitions. [2025-01-09 02:59:08,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:59:08,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 02:59:08,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:59:08,114 INFO L225 Difference]: With dead ends: 43 [2025-01-09 02:59:08,114 INFO L226 Difference]: Without dead ends: 20 [2025-01-09 02:59:08,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:59:08,117 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:59:08,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:59:08,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-01-09 02:59:08,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-01-09 02:59:08,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 02:59:08,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2025-01-09 02:59:08,143 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 8 [2025-01-09 02:59:08,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:59:08,144 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2025-01-09 02:59:08,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:08,144 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2025-01-09 02:59:08,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 02:59:08,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:59:08,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:59:08,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:59:08,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:59:08,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:59:08,145 INFO L85 PathProgramCache]: Analyzing trace with hash 149721982, now seen corresponding path program 1 times [2025-01-09 02:59:08,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:59:08,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247709076] [2025-01-09 02:59:08,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:59:08,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:59:08,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 02:59:08,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 02:59:08,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:59:08,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:59:08,235 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 02:59:08,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:59:08,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247709076] [2025-01-09 02:59:08,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247709076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:59:08,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:59:08,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 02:59:08,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480412772] [2025-01-09 02:59:08,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:59:08,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 02:59:08,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:59:08,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 02:59:08,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:59:08,237 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:08,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:59:08,311 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2025-01-09 02:59:08,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:59:08,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 02:59:08,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:59:08,312 INFO L225 Difference]: With dead ends: 26 [2025-01-09 02:59:08,312 INFO L226 Difference]: Without dead ends: 24 [2025-01-09 02:59:08,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:59:08,313 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:59:08,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 76 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:59:08,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-09 02:59:08,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-01-09 02:59:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 02:59:08,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-01-09 02:59:08,319 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 8 [2025-01-09 02:59:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:59:08,319 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-01-09 02:59:08,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-01-09 02:59:08,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 02:59:08,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:59:08,320 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:59:08,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:59:08,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:59:08,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:59:08,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1832483646, now seen corresponding path program 1 times [2025-01-09 02:59:08,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:59:08,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134502929] [2025-01-09 02:59:08,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:59:08,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:59:08,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 02:59:08,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 02:59:08,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:59:08,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:59:08,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:59:08,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:59:08,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134502929] [2025-01-09 02:59:08,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134502929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:59:08,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:59:08,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 02:59:08,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663630262] [2025-01-09 02:59:08,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:59:08,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:59:08,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:59:08,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:59:08,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:59:08,429 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:59:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:59:08,516 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2025-01-09 02:59:08,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 02:59:08,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-01-09 02:59:08,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:59:08,517 INFO L225 Difference]: With dead ends: 42 [2025-01-09 02:59:08,517 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 02:59:08,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 02:59:08,518 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:59:08,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 91 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:59:08,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 02:59:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2025-01-09 02:59:08,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 02:59:08,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2025-01-09 02:59:08,527 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 13 [2025-01-09 02:59:08,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:59:08,527 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2025-01-09 02:59:08,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:59:08,527 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2025-01-09 02:59:08,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 02:59:08,528 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:59:08,528 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:59:08,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:59:08,528 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:59:08,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:59:08,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1336181566, now seen corresponding path program 1 times [2025-01-09 02:59:08,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:59:08,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145516521] [2025-01-09 02:59:08,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:59:08,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:59:08,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 02:59:08,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 02:59:08,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:59:08,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:59:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 02:59:08,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:59:08,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145516521] [2025-01-09 02:59:08,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145516521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:59:08,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:59:08,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 02:59:08,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193610577] [2025-01-09 02:59:08,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:59:08,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:59:08,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:59:08,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:59:08,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:59:08,632 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 02:59:08,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:59:08,709 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2025-01-09 02:59:08,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 02:59:08,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-01-09 02:59:08,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:59:08,710 INFO L225 Difference]: With dead ends: 46 [2025-01-09 02:59:08,710 INFO L226 Difference]: Without dead ends: 44 [2025-01-09 02:59:08,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 02:59:08,710 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:59:08,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 91 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:59:08,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-09 02:59:08,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-01-09 02:59:08,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 02:59:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2025-01-09 02:59:08,718 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 18 [2025-01-09 02:59:08,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:59:08,718 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2025-01-09 02:59:08,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 02:59:08,718 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2025-01-09 02:59:08,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 02:59:08,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:59:08,718 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:59:08,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 02:59:08,718 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:59:08,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:59:08,719 INFO L85 PathProgramCache]: Analyzing trace with hash -553938178, now seen corresponding path program 1 times [2025-01-09 02:59:08,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:59:08,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514218200] [2025-01-09 02:59:08,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:59:08,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:59:08,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 02:59:08,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 02:59:08,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:59:08,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:59:08,817 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 02:59:08,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:59:08,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514218200] [2025-01-09 02:59:08,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514218200] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:59:08,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:59:08,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 02:59:08,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966838352] [2025-01-09 02:59:08,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:59:08,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 02:59:08,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:59:08,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 02:59:08,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:59:08,818 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:59:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:59:08,878 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2025-01-09 02:59:08,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:59:08,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2025-01-09 02:59:08,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:59:08,881 INFO L225 Difference]: With dead ends: 89 [2025-01-09 02:59:08,883 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 02:59:08,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:59:08,884 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:59:08,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 107 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:59:08,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 02:59:08,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-09 02:59:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 02:59:08,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2025-01-09 02:59:08,899 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 23 [2025-01-09 02:59:08,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:59:08,900 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2025-01-09 02:59:08,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:59:08,900 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2025-01-09 02:59:08,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 02:59:08,900 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:59:08,900 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-09 02:59:08,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 02:59:08,901 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:59:08,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:59:08,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1842573482, now seen corresponding path program 1 times [2025-01-09 02:59:08,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:59:08,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393030689] [2025-01-09 02:59:08,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:59:08,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:59:08,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 02:59:08,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 02:59:08,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:59:08,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:59:08,986 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-01-09 02:59:08,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:59:08,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393030689] [2025-01-09 02:59:08,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393030689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:59:08,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:59:08,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:59:08,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455698363] [2025-01-09 02:59:08,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:59:08,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:59:08,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:59:08,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:59:08,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:59:08,987 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 02:59:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:59:09,027 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2025-01-09 02:59:09,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:59:09,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2025-01-09 02:59:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:59:09,028 INFO L225 Difference]: With dead ends: 62 [2025-01-09 02:59:09,029 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 02:59:09,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:59:09,029 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:59:09,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 71 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:59:09,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 02:59:09,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-09 02:59:09,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 02:59:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2025-01-09 02:59:09,039 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 44 [2025-01-09 02:59:09,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:59:09,039 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2025-01-09 02:59:09,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 02:59:09,039 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2025-01-09 02:59:09,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 02:59:09,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:59:09,041 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:59:09,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 02:59:09,041 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:59:09,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:59:09,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1789984255, now seen corresponding path program 1 times [2025-01-09 02:59:09,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:59:09,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233626754] [2025-01-09 02:59:09,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:59:09,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:59:09,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 02:59:09,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 02:59:09,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:59:09,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:59:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 02:59:09,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:59:09,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233626754] [2025-01-09 02:59:09,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233626754] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:59:09,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807656823] [2025-01-09 02:59:09,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:59:09,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:59:09,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:59:09,117 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 02:59:09,119 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 02:59:09,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 02:59:09,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 02:59:09,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:59:09,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:59:09,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 02:59:09,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:59:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 184 proven. 7 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-01-09 02:59:09,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:59:09,281 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 02:59:09,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807656823] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:59:09,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:59:09,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 02:59:09,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167686989] [2025-01-09 02:59:09,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:59:09,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:59:09,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:59:09,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:59:09,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:59:09,283 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-01-09 02:59:09,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:59:09,357 INFO L93 Difference]: Finished difference Result 126 states and 175 transitions. [2025-01-09 02:59:09,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:59:09,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 78 [2025-01-09 02:59:09,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:59:09,359 INFO L225 Difference]: With dead ends: 126 [2025-01-09 02:59:09,361 INFO L226 Difference]: Without dead ends: 80 [2025-01-09 02:59:09,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 152 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:59:09,362 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:59:09,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:59:09,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-09 02:59:09,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-09 02:59:09,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 02:59:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2025-01-09 02:59:09,381 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 78 [2025-01-09 02:59:09,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:59:09,381 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2025-01-09 02:59:09,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-01-09 02:59:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2025-01-09 02:59:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 02:59:09,383 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:59:09,383 INFO L218 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:59:09,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 02:59:09,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:59:09,584 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:59:09,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:59:09,584 INFO L85 PathProgramCache]: Analyzing trace with hash 820743809, now seen corresponding path program 2 times [2025-01-09 02:59:09,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:59:09,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571829514] [2025-01-09 02:59:09,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:59:09,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:59:09,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-01-09 02:59:09,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 02:59:09,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:59:09,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:59:09,875 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2025-01-09 02:59:09,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:59:09,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571829514] [2025-01-09 02:59:09,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571829514] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:59:09,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358802930] [2025-01-09 02:59:09,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:59:09,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:59:09,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:59:09,879 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 02:59:09,880 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 02:59:09,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-01-09 02:59:09,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 02:59:09,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:59:09,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:59:09,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 02:59:09,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:59:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 49 proven. 41 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 02:59:10,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:59:10,383 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2025-01-09 02:59:10,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358802930] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 02:59:10,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:59:10,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 13] total 22 [2025-01-09 02:59:10,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538385419] [2025-01-09 02:59:10,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:59:10,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 02:59:10,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:59:10,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 02:59:10,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2025-01-09 02:59:10,385 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 02:59:10,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:59:10,448 INFO L93 Difference]: Finished difference Result 86 states and 120 transitions. [2025-01-09 02:59:10,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:59:10,452 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 120 [2025-01-09 02:59:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:59:10,453 INFO L225 Difference]: With dead ends: 86 [2025-01-09 02:59:10,453 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 02:59:10,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 226 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2025-01-09 02:59:10,454 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:59:10,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:59:10,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 02:59:10,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-09 02:59:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 38 states have internal predecessors, (40), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 02:59:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2025-01-09 02:59:10,473 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 120 [2025-01-09 02:59:10,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:59:10,473 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 118 transitions. [2025-01-09 02:59:10,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 02:59:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 118 transitions. [2025-01-09 02:59:10,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 02:59:10,474 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:59:10,474 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:59:10,481 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 02:59:10,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:59:10,676 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:59:10,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:59:10,676 INFO L85 PathProgramCache]: Analyzing trace with hash -375717413, now seen corresponding path program 3 times [2025-01-09 02:59:10,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:59:10,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331686552] [2025-01-09 02:59:10,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:59:10,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:59:10,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 125 statements into 12 equivalence classes. [2025-01-09 02:59:10,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 125 statements. [2025-01-09 02:59:10,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 02:59:10,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:59:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 959 trivial. 0 not checked. [2025-01-09 02:59:10,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:59:10,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331686552] [2025-01-09 02:59:10,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331686552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:59:10,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:59:10,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 02:59:10,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587016421] [2025-01-09 02:59:10,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:59:10,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 02:59:10,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:59:10,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 02:59:10,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:59:10,739 INFO L87 Difference]: Start difference. First operand 84 states and 118 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 02:59:10,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:59:10,800 INFO L93 Difference]: Finished difference Result 84 states and 118 transitions. [2025-01-09 02:59:10,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:59:10,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 125 [2025-01-09 02:59:10,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:59:10,802 INFO L225 Difference]: With dead ends: 84 [2025-01-09 02:59:10,802 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 02:59:10,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:59:10,804 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:59:10,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 77 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:59:10,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 02:59:10,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 02:59:10,805 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 02:59:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 02:59:10,805 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2025-01-09 02:59:10,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:59:10,805 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 02:59:10,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 02:59:10,806 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 02:59:10,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 02:59:10,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 02:59:10,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 02:59:10,811 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2025-01-09 02:59:10,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 02:59:11,117 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 02:59:11,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:59:11 BoogieIcfgContainer [2025-01-09 02:59:11,128 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 02:59:11,129 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 02:59:11,129 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 02:59:11,129 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 02:59:11,130 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:59:07" (3/4) ... [2025-01-09 02:59:11,131 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 02:59:11,135 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-09 02:59:11,137 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-01-09 02:59:11,138 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 02:59:11,138 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 02:59:11,138 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 02:59:11,189 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 02:59:11,189 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 02:59:11,189 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 02:59:11,190 INFO L158 Benchmark]: Toolchain (without parser) took 3753.79ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 79.7MB in the end (delta: 43.3MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2025-01-09 02:59:11,190 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:59:11,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.94ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 112.3MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:59:11,191 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.11ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 111.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:59:11,191 INFO L158 Benchmark]: Boogie Preprocessor took 27.57ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 110.2MB in the end (delta: 821.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:59:11,191 INFO L158 Benchmark]: RCFGBuilder took 189.54ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 99.9MB in the end (delta: 9.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 02:59:11,192 INFO L158 Benchmark]: TraceAbstraction took 3287.18ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 86.4MB in the end (delta: 13.2MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2025-01-09 02:59:11,192 INFO L158 Benchmark]: Witness Printer took 60.49ms. Allocated memory is still 167.8MB. Free memory was 86.4MB in the beginning and 79.7MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:59:11,193 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.15ms. Allocated memory is still 201.3MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 161.94ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 112.3MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.11ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 111.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.57ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 110.2MB in the end (delta: 821.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 189.54ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 99.9MB in the end (delta: 9.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3287.18ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 86.4MB in the end (delta: 13.2MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Witness Printer took 60.49ms. Allocated memory is still 167.8MB. Free memory was 86.4MB in the beginning and 79.7MB in the end (delta: 6.6MB). 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: 13]: 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, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 9, TraceHistogramMax: 23, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 748 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 537 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 344 IncrementalHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 211 mSDtfsCounter, 344 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 459 GetRequests, 393 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=8, InterpolantAutomatonStates: 52, 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, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 635 NumberOfCodeBlocks, 531 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 820 ConstructedInterpolants, 0 QuantifiedInterpolants, 1372 SizeOfPredicates, 1 NumberOfNonLiveVariables, 420 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 4932/5000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((i <= 3) && (0 <= i)) && (j == 0)) || ((((j <= 4) && (1 <= j)) && (i <= ((long long) 3 + j))) && (j <= i))) RESULT: Ultimate proved your program to be correct! [2025-01-09 02:59:11,212 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