./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_label09.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 f81dd1ef8995b0b07e1ce6d856db2fedb8abb1366230168a1e5c2e68aff05e24 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:08:17,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:08:17,559 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:08:17,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:08:17,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:08:17,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:08:17,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:08:17,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:08:17,585 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:08:17,585 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:08:17,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:08:17,586 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:08:17,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:08:17,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:08:17,586 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:08:17,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:08:17,586 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:08:17,586 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:08:17,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:08:17,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:08:17,587 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:08:17,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:08:17,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:08:17,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:08:17,587 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:08:17,587 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:08:17,587 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:08:17,587 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:08:17,587 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:08:17,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:08:17,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:08:17,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:08:17,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:08:17,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:08:17,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:08:17,588 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:08:17,588 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:08:17,588 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:08:17,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:08:17,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:08:17,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:08:17,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:08:17,588 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:08:17,588 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 -> f81dd1ef8995b0b07e1ce6d856db2fedb8abb1366230168a1e5c2e68aff05e24 [2025-03-16 14:08:17,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:08:17,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:08:17,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:08:17,815 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:08:17,815 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:08:17,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label09.c [2025-03-16 14:08:18,927 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/474323f2d/d90b248a4a714be280654d027d642e27/FLAG2334dc2ba [2025-03-16 14:08:19,243 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:08:19,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label09.c [2025-03-16 14:08:19,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/474323f2d/d90b248a4a714be280654d027d642e27/FLAG2334dc2ba [2025-03-16 14:08:19,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/474323f2d/d90b248a4a714be280654d027d642e27 [2025-03-16 14:08:19,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:08:19,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:08:19,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:08:19,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:08:19,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:08:19,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:08:19" (1/1) ... [2025-03-16 14:08:19,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e797dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:19, skipping insertion in model container [2025-03-16 14:08:19,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:08:19" (1/1) ... [2025-03-16 14:08:19,521 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:08:19,771 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_label09.c[19170,19183] [2025-03-16 14:08:19,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:08:19,813 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:08:19,880 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_label09.c[19170,19183] [2025-03-16 14:08:19,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:08:19,899 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:08:19,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:19 WrapperNode [2025-03-16 14:08:19,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:08:19,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:08:19,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:08:19,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:08:19,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:19" (1/1) ... [2025-03-16 14:08:19,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:19" (1/1) ... [2025-03-16 14:08:19,950 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666 [2025-03-16 14:08:19,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:08:19,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:08:19,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:08:19,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:08:19,957 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:19" (1/1) ... [2025-03-16 14:08:19,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:19" (1/1) ... [2025-03-16 14:08:19,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:19" (1/1) ... [2025-03-16 14:08:19,982 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-16 14:08:19,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:19" (1/1) ... [2025-03-16 14:08:19,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:19" (1/1) ... [2025-03-16 14:08:20,001 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:19" (1/1) ... [2025-03-16 14:08:20,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:19" (1/1) ... [2025-03-16 14:08:20,008 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:19" (1/1) ... [2025-03-16 14:08:20,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:19" (1/1) ... [2025-03-16 14:08:20,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:08:20,019 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:08:20,019 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:08:20,019 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:08:20,021 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:19" (1/1) ... [2025-03-16 14:08:20,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:08:20,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:08:20,045 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-16 14:08:20,049 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-16 14:08:20,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:08:20,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:08:20,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:08:20,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:08:20,115 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:08:20,116 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:08:20,902 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-16 14:08:20,902 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:08:20,913 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:08:20,916 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:08:20,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:08:20 BoogieIcfgContainer [2025-03-16 14:08:20,917 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:08:20,918 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:08:20,918 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:08:20,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:08:20,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:08:19" (1/3) ... [2025-03-16 14:08:20,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f65d6af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:08:20, skipping insertion in model container [2025-03-16 14:08:20,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:19" (2/3) ... [2025-03-16 14:08:20,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f65d6af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:08:20, skipping insertion in model container [2025-03-16 14:08:20,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:08:20" (3/3) ... [2025-03-16 14:08:20,924 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem02_label09.c [2025-03-16 14:08:20,934 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:08:20,935 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label09.c that has 1 procedures, 166 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:08:20,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:08:20,988 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;@7a982ba9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:08:20,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:08:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 166 states, 164 states have (on average 1.9085365853658536) internal successors, (313), 165 states have internal predecessors, (313), 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-16 14:08:21,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-16 14:08:21,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:21,002 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:21,002 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:21,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:21,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1119793753, now seen corresponding path program 1 times [2025-03-16 14:08:21,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:21,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819145624] [2025-03-16 14:08:21,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:21,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:21,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 14:08:21,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 14:08:21,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:21,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:21,317 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-16 14:08:21,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:21,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819145624] [2025-03-16 14:08:21,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819145624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:21,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:21,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:21,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799912146] [2025-03-16 14:08:21,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:21,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:08:21,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:21,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:08:21,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:08:21,340 INFO L87 Difference]: Start difference. First operand has 166 states, 164 states have (on average 1.9085365853658536) internal successors, (313), 165 states have internal predecessors, (313), 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 2 states, 2 states have (on average 60.0) internal successors, (120), 2 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-16 14:08:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:21,366 INFO L93 Difference]: Finished difference Result 331 states and 625 transitions. [2025-03-16 14:08:21,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:08:21,368 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 60.0) internal successors, (120), 2 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 120 [2025-03-16 14:08:21,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:21,374 INFO L225 Difference]: With dead ends: 331 [2025-03-16 14:08:21,374 INFO L226 Difference]: Without dead ends: 163 [2025-03-16 14:08:21,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:08:21,380 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:21,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:08:21,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-16 14:08:21,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-03-16 14:08:21,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 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-16 14:08:21,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2025-03-16 14:08:21,408 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 120 [2025-03-16 14:08:21,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:21,409 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2025-03-16 14:08:21,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 60.0) internal successors, (120), 2 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-16 14:08:21,409 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2025-03-16 14:08:21,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-16 14:08:21,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:21,411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:21,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:08:21,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:21,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:21,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1728561191, now seen corresponding path program 1 times [2025-03-16 14:08:21,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:21,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601400571] [2025-03-16 14:08:21,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:21,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:21,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 14:08:21,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 14:08:21,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:21,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:21,694 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-16 14:08:21,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:21,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601400571] [2025-03-16 14:08:21,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601400571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:21,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:21,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:21,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049168670] [2025-03-16 14:08:21,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:21,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:21,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:21,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:21,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:21,702 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 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-16 14:08:22,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:22,152 INFO L93 Difference]: Finished difference Result 479 states and 734 transitions. [2025-03-16 14:08:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:22,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 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 120 [2025-03-16 14:08:22,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:22,155 INFO L225 Difference]: With dead ends: 479 [2025-03-16 14:08:22,156 INFO L226 Difference]: Without dead ends: 317 [2025-03-16 14:08:22,157 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-16 14:08:22,158 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 55 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:22,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 99 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:08:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-16 14:08:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 312. [2025-03-16 14:08:22,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.472668810289389) internal successors, (458), 311 states have internal predecessors, (458), 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-16 14:08:22,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 458 transitions. [2025-03-16 14:08:22,180 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 458 transitions. Word has length 120 [2025-03-16 14:08:22,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:22,181 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 458 transitions. [2025-03-16 14:08:22,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 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-16 14:08:22,181 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 458 transitions. [2025-03-16 14:08:22,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-16 14:08:22,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:22,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:22,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:08:22,186 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:22,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:22,186 INFO L85 PathProgramCache]: Analyzing trace with hash 525829992, now seen corresponding path program 1 times [2025-03-16 14:08:22,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:22,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566360430] [2025-03-16 14:08:22,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:22,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:22,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-16 14:08:22,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-16 14:08:22,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:22,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:22,503 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-16 14:08:22,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:22,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566360430] [2025-03-16 14:08:22,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566360430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:22,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:22,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:22,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144819493] [2025-03-16 14:08:22,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:22,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:08:22,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:22,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:08:22,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:08:22,506 INFO L87 Difference]: Start difference. First operand 312 states and 458 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 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-16 14:08:23,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:23,082 INFO L93 Difference]: Finished difference Result 988 states and 1491 transitions. [2025-03-16 14:08:23,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:08:23,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 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-16 14:08:23,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:23,085 INFO L225 Difference]: With dead ends: 988 [2025-03-16 14:08:23,085 INFO L226 Difference]: Without dead ends: 594 [2025-03-16 14:08:23,086 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-16 14:08:23,086 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 170 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:23,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 116 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:08:23,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-16 14:08:23,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2025-03-16 14:08:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 1.3389544688026982) internal successors, (794), 593 states have internal predecessors, (794), 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-16 14:08:23,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 794 transitions. [2025-03-16 14:08:23,113 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 794 transitions. Word has length 124 [2025-03-16 14:08:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:23,114 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 794 transitions. [2025-03-16 14:08:23,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 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-16 14:08:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 794 transitions. [2025-03-16 14:08:23,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 14:08:23,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:23,119 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:23,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:08:23,120 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:23,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:23,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1776031451, now seen corresponding path program 1 times [2025-03-16 14:08:23,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:23,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452208263] [2025-03-16 14:08:23,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:23,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:23,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 14:08:23,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 14:08:23,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:23,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:23,265 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:08:23,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:23,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452208263] [2025-03-16 14:08:23,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452208263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:23,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:23,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:23,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699057494] [2025-03-16 14:08:23,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:23,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:23,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:23,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:23,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:23,269 INFO L87 Difference]: Start difference. First operand 594 states and 794 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 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-16 14:08:23,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:23,658 INFO L93 Difference]: Finished difference Result 1752 states and 2345 transitions. [2025-03-16 14:08:23,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:23,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 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 150 [2025-03-16 14:08:23,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:23,662 INFO L225 Difference]: With dead ends: 1752 [2025-03-16 14:08:23,662 INFO L226 Difference]: Without dead ends: 1159 [2025-03-16 14:08:23,663 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-16 14:08:23,663 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 126 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 126 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-16 14:08:23,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 126 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:08:23,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-03-16 14:08:23,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1156. [2025-03-16 14:08:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.2095238095238094) internal successors, (1397), 1155 states have internal predecessors, (1397), 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-16 14:08:23,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1397 transitions. [2025-03-16 14:08:23,694 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1397 transitions. Word has length 150 [2025-03-16 14:08:23,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:23,694 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1397 transitions. [2025-03-16 14:08:23,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 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-16 14:08:23,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1397 transitions. [2025-03-16 14:08:23,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-16 14:08:23,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:23,698 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:23,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:08:23,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:23,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:23,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1733625421, now seen corresponding path program 1 times [2025-03-16 14:08:23,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:23,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321219809] [2025-03-16 14:08:23,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:23,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:23,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 14:08:23,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 14:08:23,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:23,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 14:08:23,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:23,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321219809] [2025-03-16 14:08:23,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321219809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:23,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:23,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:23,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473865943] [2025-03-16 14:08:23,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:23,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:23,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:23,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:23,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:23,821 INFO L87 Difference]: Start difference. First operand 1156 states and 1397 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-16 14:08:24,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:24,202 INFO L93 Difference]: Finished difference Result 2732 states and 3362 transitions. [2025-03-16 14:08:24,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:24,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 153 [2025-03-16 14:08:24,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:24,207 INFO L225 Difference]: With dead ends: 2732 [2025-03-16 14:08:24,208 INFO L226 Difference]: Without dead ends: 1432 [2025-03-16 14:08:24,209 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-16 14:08:24,211 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 139 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 273 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-16 14:08:24,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 273 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:08:24,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2025-03-16 14:08:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1292. [2025-03-16 14:08:24,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1291 states have (on average 1.1812548412083657) internal successors, (1525), 1291 states have internal predecessors, (1525), 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-16 14:08:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1525 transitions. [2025-03-16 14:08:24,239 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1525 transitions. Word has length 153 [2025-03-16 14:08:24,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:24,240 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 1525 transitions. [2025-03-16 14:08:24,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-16 14:08:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1525 transitions. [2025-03-16 14:08:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-16 14:08:24,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:24,243 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:08:24,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:08:24,243 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:24,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:24,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1307878890, now seen corresponding path program 1 times [2025-03-16 14:08:24,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:24,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041860502] [2025-03-16 14:08:24,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:24,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:24,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 14:08:24,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 14:08:24,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:24,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:24,458 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:08:24,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:24,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041860502] [2025-03-16 14:08:24,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041860502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:24,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:24,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:08:24,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154740130] [2025-03-16 14:08:24,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:24,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:08:24,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:24,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:08:24,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:08:24,463 INFO L87 Difference]: Start difference. First operand 1292 states and 1525 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 4 states have internal predecessors, (153), 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-16 14:08:25,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:25,066 INFO L93 Difference]: Finished difference Result 2723 states and 3222 transitions. [2025-03-16 14:08:25,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:08:25,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 4 states have internal predecessors, (153), 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 153 [2025-03-16 14:08:25,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:25,070 INFO L225 Difference]: With dead ends: 2723 [2025-03-16 14:08:25,071 INFO L226 Difference]: Without dead ends: 1432 [2025-03-16 14:08:25,072 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-16 14:08:25,072 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 346 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:25,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 135 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:08:25,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2025-03-16 14:08:25,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1432. [2025-03-16 14:08:25,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1431 states have (on average 1.1663172606568832) internal successors, (1669), 1431 states have internal predecessors, (1669), 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-16 14:08:25,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1669 transitions. [2025-03-16 14:08:25,094 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1669 transitions. Word has length 153 [2025-03-16 14:08:25,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:25,094 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 1669 transitions. [2025-03-16 14:08:25,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 4 states have internal predecessors, (153), 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-16 14:08:25,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1669 transitions. [2025-03-16 14:08:25,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-16 14:08:25,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:25,096 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:08:25,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:08:25,097 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:25,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:25,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1277818739, now seen corresponding path program 1 times [2025-03-16 14:08:25,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:25,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820335717] [2025-03-16 14:08:25,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:25,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:25,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 14:08:25,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 14:08:25,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:25,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:08:25,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:25,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820335717] [2025-03-16 14:08:25,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820335717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:25,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:25,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:25,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720429921] [2025-03-16 14:08:25,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:25,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:25,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:25,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:25,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:25,185 INFO L87 Difference]: Start difference. First operand 1432 states and 1669 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-16 14:08:25,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:25,551 INFO L93 Difference]: Finished difference Result 3281 states and 3833 transitions. [2025-03-16 14:08:25,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:25,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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 156 [2025-03-16 14:08:25,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:25,556 INFO L225 Difference]: With dead ends: 3281 [2025-03-16 14:08:25,557 INFO L226 Difference]: Without dead ends: 1850 [2025-03-16 14:08:25,558 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-16 14:08:25,559 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:25,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 46 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:25,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2025-03-16 14:08:25,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1709. [2025-03-16 14:08:25,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1708 states have (on average 1.1680327868852458) internal successors, (1995), 1708 states have internal predecessors, (1995), 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-16 14:08:25,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 1995 transitions. [2025-03-16 14:08:25,586 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 1995 transitions. Word has length 156 [2025-03-16 14:08:25,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:25,586 INFO L471 AbstractCegarLoop]: Abstraction has 1709 states and 1995 transitions. [2025-03-16 14:08:25,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-16 14:08:25,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 1995 transitions. [2025-03-16 14:08:25,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-16 14:08:25,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:25,589 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:08:25,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:08:25,589 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:25,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:25,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1577260253, now seen corresponding path program 1 times [2025-03-16 14:08:25,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:25,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780211642] [2025-03-16 14:08:25,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:25,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:25,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-16 14:08:25,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-16 14:08:25,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:25,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:08:25,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:25,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780211642] [2025-03-16 14:08:25,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780211642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:25,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:25,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:08:25,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664590235] [2025-03-16 14:08:25,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:25,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:08:25,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:25,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:08:25,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:08:25,743 INFO L87 Difference]: Start difference. First operand 1709 states and 1995 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 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-16 14:08:26,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:26,384 INFO L93 Difference]: Finished difference Result 3697 states and 4312 transitions. [2025-03-16 14:08:26,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:08:26,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 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 173 [2025-03-16 14:08:26,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:26,390 INFO L225 Difference]: With dead ends: 3697 [2025-03-16 14:08:26,390 INFO L226 Difference]: Without dead ends: 1709 [2025-03-16 14:08:26,391 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-16 14:08:26,392 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 331 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:26,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 149 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:08:26,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2025-03-16 14:08:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1709. [2025-03-16 14:08:26,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1708 states have (on average 1.1311475409836065) internal successors, (1932), 1708 states have internal predecessors, (1932), 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-16 14:08:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 1932 transitions. [2025-03-16 14:08:26,417 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 1932 transitions. Word has length 173 [2025-03-16 14:08:26,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:26,417 INFO L471 AbstractCegarLoop]: Abstraction has 1709 states and 1932 transitions. [2025-03-16 14:08:26,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 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-16 14:08:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 1932 transitions. [2025-03-16 14:08:26,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 14:08:26,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:26,421 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:26,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:08:26,421 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:26,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:26,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1171014234, now seen corresponding path program 1 times [2025-03-16 14:08:26,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:26,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784785167] [2025-03-16 14:08:26,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:26,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:26,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 14:08:26,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 14:08:26,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:26,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:08:26,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:26,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784785167] [2025-03-16 14:08:26,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784785167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:26,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:26,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:26,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054901510] [2025-03-16 14:08:26,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:26,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:26,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:26,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:26,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:26,511 INFO L87 Difference]: Start difference. First operand 1709 states and 1932 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-16 14:08:26,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:26,832 INFO L93 Difference]: Finished difference Result 3980 states and 4533 transitions. [2025-03-16 14:08:26,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:26,833 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 182 [2025-03-16 14:08:26,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:26,838 INFO L225 Difference]: With dead ends: 3980 [2025-03-16 14:08:26,838 INFO L226 Difference]: Without dead ends: 2129 [2025-03-16 14:08:26,840 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-16 14:08:26,841 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 134 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:26,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 211 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:26,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2025-03-16 14:08:26,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 2128. [2025-03-16 14:08:26,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2128 states, 2127 states have (on average 1.1100141043723555) internal successors, (2361), 2127 states have internal predecessors, (2361), 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-16 14:08:26,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 2361 transitions. [2025-03-16 14:08:26,871 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 2361 transitions. Word has length 182 [2025-03-16 14:08:26,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:26,872 INFO L471 AbstractCegarLoop]: Abstraction has 2128 states and 2361 transitions. [2025-03-16 14:08:26,872 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-16 14:08:26,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 2361 transitions. [2025-03-16 14:08:26,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-16 14:08:26,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:26,875 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:08:26,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:08:26,875 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:26,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:26,876 INFO L85 PathProgramCache]: Analyzing trace with hash 266664285, now seen corresponding path program 1 times [2025-03-16 14:08:26,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:26,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385170028] [2025-03-16 14:08:26,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:26,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:26,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-16 14:08:26,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-16 14:08:26,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:26,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:08:26,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:26,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385170028] [2025-03-16 14:08:26,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385170028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:26,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:26,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:26,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824186625] [2025-03-16 14:08:26,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:26,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:26,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:26,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:26,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:26,938 INFO L87 Difference]: Start difference. First operand 2128 states and 2361 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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-16 14:08:27,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:27,236 INFO L93 Difference]: Finished difference Result 4809 states and 5311 transitions. [2025-03-16 14:08:27,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:27,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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 198 [2025-03-16 14:08:27,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:27,243 INFO L225 Difference]: With dead ends: 4809 [2025-03-16 14:08:27,243 INFO L226 Difference]: Without dead ends: 2682 [2025-03-16 14:08:27,245 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-16 14:08:27,245 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 139 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:27,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 36 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:27,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2025-03-16 14:08:27,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 1982. [2025-03-16 14:08:27,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1981 states have (on average 1.0964159515396263) internal successors, (2172), 1981 states have internal predecessors, (2172), 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-16 14:08:27,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2172 transitions. [2025-03-16 14:08:27,275 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 2172 transitions. Word has length 198 [2025-03-16 14:08:27,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:27,275 INFO L471 AbstractCegarLoop]: Abstraction has 1982 states and 2172 transitions. [2025-03-16 14:08:27,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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-16 14:08:27,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2172 transitions. [2025-03-16 14:08:27,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-16 14:08:27,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:27,278 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:27,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:08:27,278 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:27,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:27,279 INFO L85 PathProgramCache]: Analyzing trace with hash 582225343, now seen corresponding path program 1 times [2025-03-16 14:08:27,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:27,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367613058] [2025-03-16 14:08:27,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:27,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:27,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-16 14:08:27,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-16 14:08:27,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:27,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-16 14:08:27,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:27,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367613058] [2025-03-16 14:08:27,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367613058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:27,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:27,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:27,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623507935] [2025-03-16 14:08:27,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:27,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:27,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:27,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:27,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:27,409 INFO L87 Difference]: Start difference. First operand 1982 states and 2172 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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-16 14:08:27,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:27,714 INFO L93 Difference]: Finished difference Result 4243 states and 4649 transitions. [2025-03-16 14:08:27,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:27,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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 240 [2025-03-16 14:08:27,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:27,720 INFO L225 Difference]: With dead ends: 4243 [2025-03-16 14:08:27,720 INFO L226 Difference]: Without dead ends: 2122 [2025-03-16 14:08:27,722 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-16 14:08:27,723 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 139 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:27,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 202 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:27,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2025-03-16 14:08:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2025-03-16 14:08:27,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2122 states, 2121 states have (on average 1.08015087223008) internal successors, (2291), 2121 states have internal predecessors, (2291), 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-16 14:08:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 2291 transitions. [2025-03-16 14:08:27,753 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 2291 transitions. Word has length 240 [2025-03-16 14:08:27,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:27,753 INFO L471 AbstractCegarLoop]: Abstraction has 2122 states and 2291 transitions. [2025-03-16 14:08:27,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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-16 14:08:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2291 transitions. [2025-03-16 14:08:27,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-03-16 14:08:27,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:27,756 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:27,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:08:27,757 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:27,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:27,758 INFO L85 PathProgramCache]: Analyzing trace with hash -560986259, now seen corresponding path program 1 times [2025-03-16 14:08:27,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:27,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442337115] [2025-03-16 14:08:27,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:27,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:27,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-03-16 14:08:27,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-03-16 14:08:27,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:27,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-16 14:08:27,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:27,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442337115] [2025-03-16 14:08:27,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442337115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:27,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:27,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:27,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683141516] [2025-03-16 14:08:27,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:27,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:27,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:27,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:27,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:27,835 INFO L87 Difference]: Start difference. First operand 2122 states and 2291 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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-16 14:08:28,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:28,106 INFO L93 Difference]: Finished difference Result 4241 states and 4569 transitions. [2025-03-16 14:08:28,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:28,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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 243 [2025-03-16 14:08:28,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:28,107 INFO L225 Difference]: With dead ends: 4241 [2025-03-16 14:08:28,107 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:08:28,110 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-16 14:08:28,110 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 140 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:28,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 55 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:08:28,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:08:28,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:08:28,111 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-16 14:08:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:08:28,111 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 243 [2025-03-16 14:08:28,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:28,111 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:08:28,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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-16 14:08:28,111 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:08:28,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:08:28,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:08:28,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:08:28,117 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:28,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:08:28,298 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:08:28,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:08:28 BoogieIcfgContainer [2025-03-16 14:08:28,313 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:08:28,313 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:08:28,313 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:08:28,313 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:08:28,314 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:08:20" (3/4) ... [2025-03-16 14:08:28,315 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:08:28,331 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:08:28,332 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:08:28,332 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:08:28,333 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:08:28,431 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:08:28,432 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:08:28,432 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:08:28,432 INFO L158 Benchmark]: Toolchain (without parser) took 8943.09ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 104.5MB in the beginning and 130.1MB in the end (delta: -25.6MB). Peak memory consumption was 161.4MB. Max. memory is 16.1GB. [2025-03-16 14:08:28,432 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:08:28,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.76ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 79.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:08:28,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.86ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 73.6MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:08:28,434 INFO L158 Benchmark]: Boogie Preprocessor took 63.88ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 70.0MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:08:28,434 INFO L158 Benchmark]: IcfgBuilder took 897.78ms. Allocated memory is still 142.6MB. Free memory was 70.0MB in the beginning and 66.3MB in the end (delta: 3.7MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2025-03-16 14:08:28,434 INFO L158 Benchmark]: TraceAbstraction took 7394.66ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 66.3MB in the beginning and 143.1MB in the end (delta: -76.8MB). Peak memory consumption was 103.2MB. Max. memory is 16.1GB. [2025-03-16 14:08:28,434 INFO L158 Benchmark]: Witness Printer took 118.49ms. Allocated memory is still 327.2MB. Free memory was 143.1MB in the beginning and 130.1MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:08:28,436 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.26ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.76ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 79.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.86ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 73.6MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.88ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 70.0MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 897.78ms. Allocated memory is still 142.6MB. Free memory was 70.0MB in the beginning and 66.3MB in the end (delta: 3.7MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7394.66ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 66.3MB in the beginning and 143.1MB in the end (delta: -76.8MB). Peak memory consumption was 103.2MB. Max. memory is 16.1GB. * Witness Printer took 118.49ms. Allocated memory is still 327.2MB. Free memory was 143.1MB in the beginning and 130.1MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. 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: 545]: 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, 166 locations, 313 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1870 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1870 mSDsluCounter, 1699 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 274 mSDsCounter, 754 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5332 IncrementalHoareTripleChecker+Invalid, 6086 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 754 mSolverCounterUnsat, 1425 mSDtfsCounter, 5332 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2128occurred in iteration=9, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 990 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2012 NumberOfCodeBlocks, 2012 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2000 ConstructedInterpolants, 0 QuantifiedInterpolants, 4828 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 902/902 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: ((((((((((((a25 == 0) && (a28 <= 7)) || ((((((a17 == 8) && (a25 == 1)) && (a28 == 11)) && (a21 == 1)) && (a19 == 1)) && (a11 != 1))) || (((((a17 == 8) && (9 <= a28)) && (a21 == 1)) && (a28 <= 10)) && (a19 == 1))) || ((a11 != 1) && (a25 == 0))) || ((a28 == 10) && (a11 != 1))) || ((a19 == 1) && (a28 <= 7))) || ((a11 != 1) && (a28 <= 7))) || ((a17 <= 7) && (a19 == 1))) || ((a17 <= 7) && (a25 == 0))) || ((9 <= a28) && (a17 <= 7))) || (((a28 <= 10) && (a19 == 1)) && (a11 != 1))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:08:28,451 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