./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label42.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label42.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a1d98a51bcc97ee19e0458934f0b894e85cf8f8042e38117bf0e9bc0c63c9ce --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:58:54,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:58:54,684 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:58:54,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:58:54,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:58:54,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:58:54,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:58:54,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:58:54,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:58:54,709 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:58:54,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:58:54,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:58:54,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:58:54,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:58:54,709 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:58:54,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:58:54,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:58:54,709 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:58:54,711 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:58:54,711 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:58:54,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:58:54,711 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:58:54,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:58:54,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:58:54,711 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:58:54,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:58:54,711 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:58:54,711 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:58:54,711 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:58:54,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:58:54,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:58:54,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:58:54,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:58:54,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:58:54,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:58:54,712 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:58:54,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:58:54,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:58:54,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:58:54,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:58:54,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:58:54,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:58:54,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:58:54,712 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6a1d98a51bcc97ee19e0458934f0b894e85cf8f8042e38117bf0e9bc0c63c9ce [2025-03-08 00:58:54,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:58:54,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:58:54,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:58:54,956 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:58:54,956 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:58:54,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label42.c [2025-03-08 00:58:56,159 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3ac9926d/ebde9089cf954f2d9b6985a6f5139bdf/FLAGf9aba0ab8 [2025-03-08 00:58:56,471 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:58:56,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label42.c [2025-03-08 00:58:56,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3ac9926d/ebde9089cf954f2d9b6985a6f5139bdf/FLAGf9aba0ab8 [2025-03-08 00:58:56,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3ac9926d/ebde9089cf954f2d9b6985a6f5139bdf [2025-03-08 00:58:56,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:58:56,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:58:56,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:58:56,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:58:56,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:58:56,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:58:56" (1/1) ... [2025-03-08 00:58:56,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aadd3a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:56, skipping insertion in model container [2025-03-08 00:58:56,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:58:56" (1/1) ... [2025-03-08 00:58:56,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:58:56,774 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label42.c[16787,16800] [2025-03-08 00:58:56,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:58:56,818 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:58:56,854 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label42.c[16787,16800] [2025-03-08 00:58:56,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:58:56,877 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:58:56,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:56 WrapperNode [2025-03-08 00:58:56,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:58:56,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:58:56,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:58:56,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:58:56,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:56" (1/1) ... [2025-03-08 00:58:56,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:56" (1/1) ... [2025-03-08 00:58:56,930 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666 [2025-03-08 00:58:56,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:58:56,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:58:56,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:58:56,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:58:56,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:56" (1/1) ... [2025-03-08 00:58:56,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:56" (1/1) ... [2025-03-08 00:58:56,941 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:56" (1/1) ... [2025-03-08 00:58:56,952 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 00:58:56,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:56" (1/1) ... [2025-03-08 00:58:56,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:56" (1/1) ... [2025-03-08 00:58:56,964 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:56" (1/1) ... [2025-03-08 00:58:56,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:56" (1/1) ... [2025-03-08 00:58:56,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:56" (1/1) ... [2025-03-08 00:58:56,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:56" (1/1) ... [2025-03-08 00:58:56,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:58:56,971 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:58:56,971 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:58:56,971 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:58:56,972 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:56" (1/1) ... [2025-03-08 00:58:56,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:58:56,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:58:57,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:58:57,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:58:57,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:58:57,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:58:57,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:58:57,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:58:57,080 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:58:57,082 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:58:57,903 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-08 00:58:57,903 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:58:57,915 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:58:57,915 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:58:57,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:58:57 BoogieIcfgContainer [2025-03-08 00:58:57,916 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:58:57,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:58:57,918 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:58:57,921 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:58:57,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:58:56" (1/3) ... [2025-03-08 00:58:57,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe4fb58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:58:57, skipping insertion in model container [2025-03-08 00:58:57,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:56" (2/3) ... [2025-03-08 00:58:57,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe4fb58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:58:57, skipping insertion in model container [2025-03-08 00:58:57,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:58:57" (3/3) ... [2025-03-08 00:58:57,922 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem02_label42.c [2025-03-08 00:58:57,932 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:58:57,933 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label42.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 00:58:57,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:58:57,986 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;@318bc2cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:58:57,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:58:57,989 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:58:57,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 00:58:57,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:58:57,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:58:57,997 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:58:58,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:58:58,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1868324882, now seen corresponding path program 1 times [2025-03-08 00:58:58,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:58:58,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867546824] [2025-03-08 00:58:58,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:58:58,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:58:58,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 00:58:58,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 00:58:58,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:58:58,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:58:58,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:58:58,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:58:58,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867546824] [2025-03-08 00:58:58,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867546824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:58:58,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:58:58,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:58:58,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374008001] [2025-03-08 00:58:58,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:58:58,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:58:58,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:58:58,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:58:58,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:58:58,467 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:58:59,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:58:59,049 INFO L93 Difference]: Finished difference Result 630 states and 1067 transitions. [2025-03-08 00:58:59,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:58:59,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-08 00:58:59,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:58:59,060 INFO L225 Difference]: With dead ends: 630 [2025-03-08 00:58:59,060 INFO L226 Difference]: Without dead ends: 318 [2025-03-08 00:58:59,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:58:59,066 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 130 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:58:59,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 119 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:58:59,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-08 00:58:59,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2025-03-08 00:58:59,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.473186119873817) internal successors, (467), 317 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:58:59,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 467 transitions. [2025-03-08 00:58:59,111 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 467 transitions. Word has length 100 [2025-03-08 00:58:59,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:58:59,111 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 467 transitions. [2025-03-08 00:58:59,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:58:59,112 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 467 transitions. [2025-03-08 00:58:59,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 00:58:59,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:58:59,115 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:58:59,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:58:59,116 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:58:59,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:58:59,116 INFO L85 PathProgramCache]: Analyzing trace with hash 21609041, now seen corresponding path program 1 times [2025-03-08 00:58:59,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:58:59,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913083521] [2025-03-08 00:58:59,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:58:59,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:58:59,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 00:58:59,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 00:58:59,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:58:59,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:58:59,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:58:59,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:58:59,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913083521] [2025-03-08 00:58:59,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913083521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:58:59,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:58:59,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:58:59,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784214860] [2025-03-08 00:58:59,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:58:59,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:58:59,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:58:59,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:58:59,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:58:59,487 INFO L87 Difference]: Start difference. First operand 318 states and 467 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:00,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:00,065 INFO L93 Difference]: Finished difference Result 999 states and 1508 transitions. [2025-03-08 00:59:00,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:59:00,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-08 00:59:00,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:00,068 INFO L225 Difference]: With dead ends: 999 [2025-03-08 00:59:00,068 INFO L226 Difference]: Without dead ends: 600 [2025-03-08 00:59:00,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:59:00,070 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 171 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:00,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 113 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:59:00,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-08 00:59:00,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-03-08 00:59:00,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.358931552587646) internal successors, (814), 599 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 814 transitions. [2025-03-08 00:59:00,090 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 814 transitions. Word has length 104 [2025-03-08 00:59:00,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:00,090 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 814 transitions. [2025-03-08 00:59:00,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 814 transitions. [2025-03-08 00:59:00,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 00:59:00,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:00,097 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:00,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:59:00,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:00,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:00,099 INFO L85 PathProgramCache]: Analyzing trace with hash 103097001, now seen corresponding path program 1 times [2025-03-08 00:59:00,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:00,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286867578] [2025-03-08 00:59:00,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:00,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:00,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 00:59:00,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 00:59:00,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:00,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:00,221 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:59:00,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:00,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286867578] [2025-03-08 00:59:00,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286867578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:00,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:00,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:59:00,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057152075] [2025-03-08 00:59:00,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:00,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:00,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:00,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:00,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:00,222 INFO L87 Difference]: Start difference. First operand 600 states and 814 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:00,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:00,553 INFO L93 Difference]: Finished difference Result 1781 states and 2421 transitions. [2025-03-08 00:59:00,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:00,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-03-08 00:59:00,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:00,560 INFO L225 Difference]: With dead ends: 1781 [2025-03-08 00:59:00,560 INFO L226 Difference]: Without dead ends: 1183 [2025-03-08 00:59:00,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:00,564 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 158 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:00,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 99 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:59:00,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-03-08 00:59:00,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1173. [2025-03-08 00:59:00,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 1.3131399317406143) internal successors, (1539), 1172 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:00,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1539 transitions. [2025-03-08 00:59:00,600 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1539 transitions. Word has length 118 [2025-03-08 00:59:00,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:00,601 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1539 transitions. [2025-03-08 00:59:00,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:00,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1539 transitions. [2025-03-08 00:59:00,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 00:59:00,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:00,605 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:00,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:59:00,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:00,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:00,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1435657446, now seen corresponding path program 1 times [2025-03-08 00:59:00,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:00,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5246887] [2025-03-08 00:59:00,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:00,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:00,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 00:59:00,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 00:59:00,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:00,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:59:00,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:00,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5246887] [2025-03-08 00:59:00,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5246887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:00,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:00,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:59:00,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235067071] [2025-03-08 00:59:00,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:00,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:00,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:00,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:00,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:00,701 INFO L87 Difference]: Start difference. First operand 1173 states and 1539 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:01,113 INFO L93 Difference]: Finished difference Result 3329 states and 4392 transitions. [2025-03-08 00:59:01,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:01,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-03-08 00:59:01,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:01,119 INFO L225 Difference]: With dead ends: 3329 [2025-03-08 00:59:01,119 INFO L226 Difference]: Without dead ends: 2158 [2025-03-08 00:59:01,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:01,121 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 124 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:01,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 129 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:59:01,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2025-03-08 00:59:01,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2155. [2025-03-08 00:59:01,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 2154 states have (on average 1.200557103064067) internal successors, (2586), 2154 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2586 transitions. [2025-03-08 00:59:01,159 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 2586 transitions. Word has length 124 [2025-03-08 00:59:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:01,159 INFO L471 AbstractCegarLoop]: Abstraction has 2155 states and 2586 transitions. [2025-03-08 00:59:01,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2586 transitions. [2025-03-08 00:59:01,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 00:59:01,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:01,163 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:01,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:59:01,164 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:01,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:01,164 INFO L85 PathProgramCache]: Analyzing trace with hash 584302364, now seen corresponding path program 1 times [2025-03-08 00:59:01,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:01,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595564855] [2025-03-08 00:59:01,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:01,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:01,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 00:59:01,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 00:59:01,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:01,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:59:01,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:01,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595564855] [2025-03-08 00:59:01,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595564855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:59:01,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697832376] [2025-03-08 00:59:01,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:01,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:59:01,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:59:01,449 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:59:01,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:59:01,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 00:59:01,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 00:59:01,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:01,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:01,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:59:01,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:59:01,674 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:59:01,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:59:01,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697832376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:01,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:59:01,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 00:59:01,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790812195] [2025-03-08 00:59:01,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:01,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:01,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:01,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:01,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:59:01,677 INFO L87 Difference]: Start difference. First operand 2155 states and 2586 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:02,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:02,090 INFO L93 Difference]: Finished difference Result 5008 states and 6119 transitions. [2025-03-08 00:59:02,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:02,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-03-08 00:59:02,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:02,097 INFO L225 Difference]: With dead ends: 5008 [2025-03-08 00:59:02,098 INFO L226 Difference]: Without dead ends: 2145 [2025-03-08 00:59:02,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:59:02,103 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 46 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:02,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 275 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:59:02,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2025-03-08 00:59:02,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 2145. [2025-03-08 00:59:02,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 2144 states have (on average 1.1730410447761195) internal successors, (2515), 2144 states have internal predecessors, (2515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 2515 transitions. [2025-03-08 00:59:02,142 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 2515 transitions. Word has length 127 [2025-03-08 00:59:02,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:02,142 INFO L471 AbstractCegarLoop]: Abstraction has 2145 states and 2515 transitions. [2025-03-08 00:59:02,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:02,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2515 transitions. [2025-03-08 00:59:02,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 00:59:02,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:02,148 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:02,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 00:59:02,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:59:02,349 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:02,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:02,349 INFO L85 PathProgramCache]: Analyzing trace with hash -2143040158, now seen corresponding path program 1 times [2025-03-08 00:59:02,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:02,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008772405] [2025-03-08 00:59:02,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:02,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:02,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 00:59:02,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 00:59:02,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:02,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:02,445 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:59:02,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:02,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008772405] [2025-03-08 00:59:02,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008772405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:02,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:02,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:59:02,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132197691] [2025-03-08 00:59:02,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:02,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:02,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:02,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:02,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:02,446 INFO L87 Difference]: Start difference. First operand 2145 states and 2515 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:02,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:02,785 INFO L93 Difference]: Finished difference Result 4846 states and 5706 transitions. [2025-03-08 00:59:02,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:02,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2025-03-08 00:59:02,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:02,794 INFO L225 Difference]: With dead ends: 4846 [2025-03-08 00:59:02,794 INFO L226 Difference]: Without dead ends: 2703 [2025-03-08 00:59:02,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:02,798 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 152 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:02,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 48 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:59:02,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2025-03-08 00:59:02,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2702. [2025-03-08 00:59:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2702 states, 2701 states have (on average 1.16401332839689) internal successors, (3144), 2701 states have internal predecessors, (3144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 3144 transitions. [2025-03-08 00:59:02,854 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 3144 transitions. Word has length 134 [2025-03-08 00:59:02,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:02,855 INFO L471 AbstractCegarLoop]: Abstraction has 2702 states and 3144 transitions. [2025-03-08 00:59:02,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:02,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 3144 transitions. [2025-03-08 00:59:02,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 00:59:02,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:02,857 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:02,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 00:59:02,858 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:02,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:02,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1780033428, now seen corresponding path program 1 times [2025-03-08 00:59:02,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:02,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127214897] [2025-03-08 00:59:02,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:02,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:02,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 00:59:02,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 00:59:02,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:02,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:59:03,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:03,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127214897] [2025-03-08 00:59:03,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127214897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:03,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:03,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:59:03,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944681955] [2025-03-08 00:59:03,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:03,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:59:03,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:03,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:59:03,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:59:03,044 INFO L87 Difference]: Start difference. First operand 2702 states and 3144 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:03,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:03,708 INFO L93 Difference]: Finished difference Result 5397 states and 6280 transitions. [2025-03-08 00:59:03,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:59:03,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2025-03-08 00:59:03,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:03,719 INFO L225 Difference]: With dead ends: 5397 [2025-03-08 00:59:03,719 INFO L226 Difference]: Without dead ends: 2697 [2025-03-08 00:59:03,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:59:03,723 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 339 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:03,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 124 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:59:03,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2025-03-08 00:59:03,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2697. [2025-03-08 00:59:03,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 2696 states have (on average 1.143545994065282) internal successors, (3083), 2696 states have internal predecessors, (3083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 3083 transitions. [2025-03-08 00:59:03,758 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 3083 transitions. Word has length 138 [2025-03-08 00:59:03,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:03,759 INFO L471 AbstractCegarLoop]: Abstraction has 2697 states and 3083 transitions. [2025-03-08 00:59:03,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:03,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 3083 transitions. [2025-03-08 00:59:03,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-08 00:59:03,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:03,762 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:03,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 00:59:03,762 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:03,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:03,763 INFO L85 PathProgramCache]: Analyzing trace with hash 203837932, now seen corresponding path program 1 times [2025-03-08 00:59:03,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:03,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728335363] [2025-03-08 00:59:03,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:03,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:03,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 00:59:03,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 00:59:03,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:03,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 65 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:59:04,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:04,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728335363] [2025-03-08 00:59:04,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728335363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:59:04,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202265493] [2025-03-08 00:59:04,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:04,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:59:04,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:59:04,053 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:59:04,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:59:04,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 00:59:04,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 00:59:04,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:04,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:04,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:59:04,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:59:04,259 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:59:04,259 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:59:04,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202265493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:04,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:59:04,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 00:59:04,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890742042] [2025-03-08 00:59:04,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:04,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:04,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:04,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:04,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:59:04,260 INFO L87 Difference]: Start difference. First operand 2697 states and 3083 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:04,612 INFO L93 Difference]: Finished difference Result 6237 states and 7228 transitions. [2025-03-08 00:59:04,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:04,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2025-03-08 00:59:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:04,623 INFO L225 Difference]: With dead ends: 6237 [2025-03-08 00:59:04,623 INFO L226 Difference]: Without dead ends: 3542 [2025-03-08 00:59:04,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:59:04,627 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 69 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:04,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 209 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:59:04,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3542 states. [2025-03-08 00:59:04,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3542 to 3120. [2025-03-08 00:59:04,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3120 states, 3119 states have (on average 1.151651170246874) internal successors, (3592), 3119 states have internal predecessors, (3592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:04,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 3592 transitions. [2025-03-08 00:59:04,684 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 3592 transitions. Word has length 174 [2025-03-08 00:59:04,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:04,684 INFO L471 AbstractCegarLoop]: Abstraction has 3120 states and 3592 transitions. [2025-03-08 00:59:04,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:04,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 3592 transitions. [2025-03-08 00:59:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 00:59:04,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:04,689 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:04,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 00:59:04,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-08 00:59:04,896 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:04,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:04,897 INFO L85 PathProgramCache]: Analyzing trace with hash 670678953, now seen corresponding path program 1 times [2025-03-08 00:59:04,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:04,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845305982] [2025-03-08 00:59:04,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:04,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:04,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 00:59:04,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 00:59:04,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:04,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 00:59:04,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:04,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845305982] [2025-03-08 00:59:04,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845305982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:04,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:04,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:59:04,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691507059] [2025-03-08 00:59:04,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:04,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:04,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:04,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:04,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:04,989 INFO L87 Difference]: Start difference. First operand 3120 states and 3592 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:05,309 INFO L93 Difference]: Finished difference Result 6938 states and 7982 transitions. [2025-03-08 00:59:05,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:05,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2025-03-08 00:59:05,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:05,317 INFO L225 Difference]: With dead ends: 6938 [2025-03-08 00:59:05,317 INFO L226 Difference]: Without dead ends: 3400 [2025-03-08 00:59:05,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:05,321 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 85 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:05,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 226 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:59:05,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2025-03-08 00:59:05,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3260. [2025-03-08 00:59:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3260 states, 3259 states have (on average 1.0935869898741946) internal successors, (3564), 3259 states have internal predecessors, (3564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3260 states to 3260 states and 3564 transitions. [2025-03-08 00:59:05,360 INFO L78 Accepts]: Start accepts. Automaton has 3260 states and 3564 transitions. Word has length 205 [2025-03-08 00:59:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:05,360 INFO L471 AbstractCegarLoop]: Abstraction has 3260 states and 3564 transitions. [2025-03-08 00:59:05,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3260 states and 3564 transitions. [2025-03-08 00:59:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-08 00:59:05,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:05,363 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:05,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 00:59:05,364 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:05,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:05,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1063913593, now seen corresponding path program 1 times [2025-03-08 00:59:05,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:05,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299126150] [2025-03-08 00:59:05,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:05,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:05,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 00:59:05,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 00:59:05,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:05,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:05,436 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-08 00:59:05,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:05,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299126150] [2025-03-08 00:59:05,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299126150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:05,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:05,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:59:05,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42854500] [2025-03-08 00:59:05,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:05,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:05,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:05,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:05,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:05,437 INFO L87 Difference]: Start difference. First operand 3260 states and 3564 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:05,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:05,763 INFO L93 Difference]: Finished difference Result 6939 states and 7572 transitions. [2025-03-08 00:59:05,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:05,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228 [2025-03-08 00:59:05,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:05,774 INFO L225 Difference]: With dead ends: 6939 [2025-03-08 00:59:05,775 INFO L226 Difference]: Without dead ends: 3399 [2025-03-08 00:59:05,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:05,780 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 159 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:05,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 69 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:59:05,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2025-03-08 00:59:05,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3259. [2025-03-08 00:59:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3259 states, 3258 states have (on average 1.0804174340085941) internal successors, (3520), 3258 states have internal predecessors, (3520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 3520 transitions. [2025-03-08 00:59:05,829 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 3520 transitions. Word has length 228 [2025-03-08 00:59:05,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:05,829 INFO L471 AbstractCegarLoop]: Abstraction has 3259 states and 3520 transitions. [2025-03-08 00:59:05,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:05,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 3520 transitions. [2025-03-08 00:59:05,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 00:59:05,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:05,832 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:05,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 00:59:05,833 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:05,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:05,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1346292535, now seen corresponding path program 1 times [2025-03-08 00:59:05,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:05,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357960419] [2025-03-08 00:59:05,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:05,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:05,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 00:59:05,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 00:59:05,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:05,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:05,928 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 00:59:05,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:05,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357960419] [2025-03-08 00:59:05,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357960419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:05,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:05,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:59:05,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240765076] [2025-03-08 00:59:05,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:05,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:05,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:05,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:05,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:05,929 INFO L87 Difference]: Start difference. First operand 3259 states and 3520 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:06,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:06,201 INFO L93 Difference]: Finished difference Result 6939 states and 7480 transitions. [2025-03-08 00:59:06,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:06,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 230 [2025-03-08 00:59:06,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:06,209 INFO L225 Difference]: With dead ends: 6939 [2025-03-08 00:59:06,209 INFO L226 Difference]: Without dead ends: 3259 [2025-03-08 00:59:06,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:06,213 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 88 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:06,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 232 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:59:06,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3259 states. [2025-03-08 00:59:06,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3259 to 3254. [2025-03-08 00:59:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3254 states, 3253 states have (on average 1.057485398094067) internal successors, (3440), 3253 states have internal predecessors, (3440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:06,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 3440 transitions. [2025-03-08 00:59:06,253 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 3440 transitions. Word has length 230 [2025-03-08 00:59:06,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:06,253 INFO L471 AbstractCegarLoop]: Abstraction has 3254 states and 3440 transitions. [2025-03-08 00:59:06,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:06,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 3440 transitions. [2025-03-08 00:59:06,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-08 00:59:06,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:06,257 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:06,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 00:59:06,258 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:06,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:06,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1835334262, now seen corresponding path program 1 times [2025-03-08 00:59:06,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:06,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949256068] [2025-03-08 00:59:06,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:06,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:06,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-08 00:59:06,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-08 00:59:06,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:06,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:06,450 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 225 proven. 16 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-08 00:59:06,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:06,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949256068] [2025-03-08 00:59:06,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949256068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:59:06,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796443052] [2025-03-08 00:59:06,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:06,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:59:06,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:59:06,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:59:06,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:59:06,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-08 00:59:06,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-08 00:59:06,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:06,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:06,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:59:06,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:59:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-08 00:59:06,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:59:06,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796443052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:06,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:59:06,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:59:06,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717876371] [2025-03-08 00:59:06,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:06,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:06,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:06,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:06,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:59:06,708 INFO L87 Difference]: Start difference. First operand 3254 states and 3440 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:06,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:06,977 INFO L93 Difference]: Finished difference Result 5655 states and 5974 transitions. [2025-03-08 00:59:06,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:06,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 246 [2025-03-08 00:59:06,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:06,978 INFO L225 Difference]: With dead ends: 5655 [2025-03-08 00:59:06,978 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 00:59:06,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:59:06,982 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 54 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:06,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 186 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:59:06,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 00:59:06,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 00:59:06,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 00:59:06,983 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2025-03-08 00:59:06,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:06,983 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 00:59:06,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 00:59:06,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 00:59:06,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:59:06,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:59:07,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:59:07,188 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:07,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 00:59:07,497 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:59:07,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:59:07 BoogieIcfgContainer [2025-03-08 00:59:07,513 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:59:07,513 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:59:07,513 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:59:07,513 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:59:07,514 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:58:57" (3/4) ... [2025-03-08 00:59:07,515 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 00:59:07,530 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 00:59:07,531 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 00:59:07,531 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 00:59:07,531 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 00:59:07,628 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 00:59:07,629 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 00:59:07,629 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:59:07,629 INFO L158 Benchmark]: Toolchain (without parser) took 11122.77ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 126.1MB in the beginning and 120.5MB in the end (delta: 5.7MB). Peak memory consumption was 113.8MB. Max. memory is 16.1GB. [2025-03-08 00:59:07,629 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 226.5MB. Free memory was 139.0MB in the beginning and 138.7MB in the end (delta: 280.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:59:07,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.39ms. Allocated memory is still 167.8MB. Free memory was 126.1MB in the beginning and 100.6MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 00:59:07,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.86ms. Allocated memory is still 167.8MB. Free memory was 100.6MB in the beginning and 95.5MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:59:07,630 INFO L158 Benchmark]: Boogie Preprocessor took 39.70ms. Allocated memory is still 167.8MB. Free memory was 95.5MB in the beginning and 91.7MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:59:07,630 INFO L158 Benchmark]: IcfgBuilder took 944.74ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 95.1MB in the end (delta: -3.5MB). Peak memory consumption was 67.3MB. Max. memory is 16.1GB. [2025-03-08 00:59:07,630 INFO L158 Benchmark]: TraceAbstraction took 9595.27ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 94.3MB in the beginning and 134.7MB in the end (delta: -40.4MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. [2025-03-08 00:59:07,630 INFO L158 Benchmark]: Witness Printer took 115.48ms. Allocated memory is still 276.8MB. Free memory was 134.7MB in the beginning and 120.5MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:59:07,631 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.24ms. Allocated memory is still 226.5MB. Free memory was 139.0MB in the beginning and 138.7MB in the end (delta: 280.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.39ms. Allocated memory is still 167.8MB. Free memory was 126.1MB in the beginning and 100.6MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.86ms. Allocated memory is still 167.8MB. Free memory was 100.6MB in the beginning and 95.5MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.70ms. Allocated memory is still 167.8MB. Free memory was 95.5MB in the beginning and 91.7MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 944.74ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 95.1MB in the end (delta: -3.5MB). Peak memory consumption was 67.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9595.27ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 94.3MB in the beginning and 134.7MB in the end (delta: -40.4MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. * Witness Printer took 115.48ms. Allocated memory is still 276.8MB. Free memory was 134.7MB in the beginning and 120.5MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 482]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 374 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1575 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1575 mSDsluCounter, 1829 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 260 mSDsCounter, 794 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5162 IncrementalHoareTripleChecker+Invalid, 5956 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 794 mSolverCounterUnsat, 1569 mSDtfsCounter, 5162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 582 GetRequests, 558 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3260occurred in iteration=9, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 721 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2475 NumberOfCodeBlocks, 2475 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2460 ConstructedInterpolants, 0 QuantifiedInterpolants, 10138 SizeOfPredicates, 0 NumberOfNonLiveVariables, 990 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 1515/1563 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: 616]: Location Invariant Derived location invariant: ((((((((((((((((((a17 == 8) && (a21 == 1)) && (a11 <= 0)) && (a19 == 1)) && (a28 <= 7)) || ((((a25 == 1) && (a11 <= 0)) && (a28 <= 10)) && (a19 == 1))) || (((a28 <= 10) && (a25 == 0)) && (a19 <= 0))) || ((((((a17 == 8) && (a25 == 1)) && (a28 == 11)) && (a21 == 1)) && (a19 == 1)) && (a11 != 1))) || (((a11 <= 0) && (a28 <= 7)) && (a19 <= 0))) || ((((((a17 == 8) && (9 <= a28)) && (a21 == 1)) && (a11 <= 0)) && (a28 <= 10)) && (a19 == 1))) || ((((((a17 == 8) && (9 <= a28)) && (a25 == 1)) && (a21 == 1)) && (a28 <= 10)) && (a19 == 1))) || ((a28 == 10) && (a19 == 1))) || (((a11 <= 0) && (a25 == 0)) && (a19 <= 0))) || ((((((a17 == 8) && (9 <= a28)) && (a21 == 1)) && (a28 <= 10)) && (a19 == 1)) && (a25 == 0))) || (a17 < 8)) || (((a25 == 1) && (a28 <= 7)) && (a19 <= 0))) || (((a25 == 1) && (a19 == 1)) && (a28 <= 7))) || ((((a25 == 1) && (a28 == 10)) && (a11 <= 0)) && (a19 <= 0))) RESULT: Ultimate proved your program to be correct! [2025-03-08 00:59:07,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE