./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label05.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5958333028b8f64162c92b3e987d78deaf3d77dc73071d1f6edce3e1a07212a4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:52:18,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:52:18,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:52:18,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:52:18,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:52:18,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:52:18,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:52:18,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:52:18,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:52:18,497 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:52:18,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:52:18,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:52:18,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:52:18,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:52:18,498 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:52:18,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:52:18,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:52:18,498 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:52:18,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:52:18,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:52:18,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:52:18,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:52:18,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:52:18,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:52:18,499 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:52:18,499 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:52:18,500 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:52:18,500 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:52:18,500 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:52:18,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:52:18,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:52:18,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:52:18,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:52:18,500 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:52:18,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:52:18,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:52:18,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:52:18,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:52:18,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:52:18,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:52:18,501 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:52:18,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:52:18,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:52:18,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:52:18,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:52:18,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:52:18,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:52:18,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:52:18,502 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5958333028b8f64162c92b3e987d78deaf3d77dc73071d1f6edce3e1a07212a4 [2025-01-08 22:52:18,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:52:18,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:52:18,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:52:18,807 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:52:18,807 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:52:18,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label05.c [2025-01-08 22:52:20,128 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c83db2347/110d4a10787f4247bf64b96c3381733b/FLAGf6b92748c [2025-01-08 22:52:20,458 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:52:20,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label05.c [2025-01-08 22:52:20,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c83db2347/110d4a10787f4247bf64b96c3381733b/FLAGf6b92748c [2025-01-08 22:52:20,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c83db2347/110d4a10787f4247bf64b96c3381733b [2025-01-08 22:52:20,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:52:20,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:52:20,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:52:20,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:52:20,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:52:20,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:52:20" (1/1) ... [2025-01-08 22:52:20,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@535c963e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:20, skipping insertion in model container [2025-01-08 22:52:20,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:52:20" (1/1) ... [2025-01-08 22:52:20,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:52:20,830 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label05.c[17240,17253] [2025-01-08 22:52:20,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:52:20,883 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:52:20,975 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label05.c[17240,17253] [2025-01-08 22:52:20,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:52:21,002 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:52:21,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:21 WrapperNode [2025-01-08 22:52:21,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:52:21,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:52:21,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:52:21,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:52:21,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:21" (1/1) ... [2025-01-08 22:52:21,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:21" (1/1) ... [2025-01-08 22:52:21,088 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-01-08 22:52:21,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:52:21,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:52:21,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:52:21,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:52:21,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:21" (1/1) ... [2025-01-08 22:52:21,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:21" (1/1) ... [2025-01-08 22:52:21,103 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:21" (1/1) ... [2025-01-08 22:52:21,129 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 22:52:21,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:21" (1/1) ... [2025-01-08 22:52:21,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:21" (1/1) ... [2025-01-08 22:52:21,154 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:21" (1/1) ... [2025-01-08 22:52:21,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:21" (1/1) ... [2025-01-08 22:52:21,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:21" (1/1) ... [2025-01-08 22:52:21,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:21" (1/1) ... [2025-01-08 22:52:21,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:21" (1/1) ... [2025-01-08 22:52:21,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:52:21,176 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:52:21,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:52:21,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:52:21,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:21" (1/1) ... [2025-01-08 22:52:21,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:52:21,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:52:21,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:52:21,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:52:21,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:52:21,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:52:21,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:52:21,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:52:21,316 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:52:21,318 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:52:22,356 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-01-08 22:52:22,357 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:52:22,376 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:52:22,377 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:52:22,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:52:22 BoogieIcfgContainer [2025-01-08 22:52:22,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:52:22,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:52:22,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:52:22,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:52:22,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:52:20" (1/3) ... [2025-01-08 22:52:22,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6ddd70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:52:22, skipping insertion in model container [2025-01-08 22:52:22,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:21" (2/3) ... [2025-01-08 22:52:22,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6ddd70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:52:22, skipping insertion in model container [2025-01-08 22:52:22,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:52:22" (3/3) ... [2025-01-08 22:52:22,391 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label05.c [2025-01-08 22:52:22,409 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:52:22,410 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label05.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:52:22,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:52:22,489 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;@b4a474f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:52:22,490 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:52:22,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:22,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-08 22:52:22,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:22,503 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] [2025-01-08 22:52:22,504 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:22,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:22,509 INFO L85 PathProgramCache]: Analyzing trace with hash 519955271, now seen corresponding path program 1 times [2025-01-08 22:52:22,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:22,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562095352] [2025-01-08 22:52:22,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:22,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:22,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-08 22:52:22,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-08 22:52:22,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:22,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:52:23,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:23,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562095352] [2025-01-08 22:52:23,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562095352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:23,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:23,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:52:23,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34187655] [2025-01-08 22:52:23,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:23,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:23,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:23,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:23,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:23,093 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:23,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:23,835 INFO L93 Difference]: Finished difference Result 528 states and 912 transitions. [2025-01-08 22:52:23,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:23,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 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 94 [2025-01-08 22:52:23,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:23,848 INFO L225 Difference]: With dead ends: 528 [2025-01-08 22:52:23,851 INFO L226 Difference]: Without dead ends: 266 [2025-01-08 22:52:23,856 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-01-08 22:52:23,858 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 78 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:23,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 84 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:52:23,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-01-08 22:52:23,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-01-08 22:52:23,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4339622641509433) internal successors, (380), 265 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:23,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2025-01-08 22:52:23,923 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 94 [2025-01-08 22:52:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:23,926 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2025-01-08 22:52:23,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:23,927 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2025-01-08 22:52:23,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-08 22:52:23,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:23,931 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 22:52:23,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:52:23,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:23,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:23,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1671937094, now seen corresponding path program 1 times [2025-01-08 22:52:23,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:23,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178153398] [2025-01-08 22:52:23,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:23,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:23,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-08 22:52:23,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-08 22:52:23,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:23,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:52:24,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:24,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178153398] [2025-01-08 22:52:24,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178153398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:24,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:24,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:52:24,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131237713] [2025-01-08 22:52:24,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:24,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:24,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:24,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:24,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:24,140 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:24,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:24,588 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2025-01-08 22:52:24,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:24,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-01-08 22:52:24,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:24,594 INFO L225 Difference]: With dead ends: 792 [2025-01-08 22:52:24,594 INFO L226 Difference]: Without dead ends: 528 [2025-01-08 22:52:24,595 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-01-08 22:52:24,596 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 145 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:24,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 17 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:52:24,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-01-08 22:52:24,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-01-08 22:52:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.413662239089184) internal successors, (745), 527 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 745 transitions. [2025-01-08 22:52:24,629 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 745 transitions. Word has length 100 [2025-01-08 22:52:24,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:24,630 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 745 transitions. [2025-01-08 22:52:24,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:24,630 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 745 transitions. [2025-01-08 22:52:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-08 22:52:24,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:24,633 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 22:52:24,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:52:24,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:24,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:24,634 INFO L85 PathProgramCache]: Analyzing trace with hash 81209333, now seen corresponding path program 1 times [2025-01-08 22:52:24,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:24,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878268620] [2025-01-08 22:52:24,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:24,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:24,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-08 22:52:24,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-08 22:52:24,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:24,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:52:24,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:24,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878268620] [2025-01-08 22:52:24,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878268620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:24,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:24,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:52:24,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513609390] [2025-01-08 22:52:24,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:24,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:24,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:24,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:24,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:24,846 INFO L87 Difference]: Start difference. First operand 528 states and 745 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:25,219 INFO L93 Difference]: Finished difference Result 1447 states and 2032 transitions. [2025-01-08 22:52:25,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:25,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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 101 [2025-01-08 22:52:25,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:25,224 INFO L225 Difference]: With dead ends: 1447 [2025-01-08 22:52:25,225 INFO L226 Difference]: Without dead ends: 921 [2025-01-08 22:52:25,226 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-01-08 22:52:25,227 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 52 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:25,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 38 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:52:25,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-01-08 22:52:25,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 659. [2025-01-08 22:52:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.3297872340425532) internal successors, (875), 658 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 875 transitions. [2025-01-08 22:52:25,256 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 875 transitions. Word has length 101 [2025-01-08 22:52:25,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:25,257 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 875 transitions. [2025-01-08 22:52:25,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 875 transitions. [2025-01-08 22:52:25,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-08 22:52:25,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:25,263 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 22:52:25,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:52:25,263 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:25,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:25,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1674577813, now seen corresponding path program 1 times [2025-01-08 22:52:25,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:25,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502655640] [2025-01-08 22:52:25,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:25,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:25,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-08 22:52:25,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-08 22:52:25,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:25,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:52:25,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:25,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502655640] [2025-01-08 22:52:25,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502655640] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:25,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:25,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:52:25,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254376044] [2025-01-08 22:52:25,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:25,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:25,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:25,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:25,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:25,530 INFO L87 Difference]: Start difference. First operand 659 states and 875 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:25,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:25,943 INFO L93 Difference]: Finished difference Result 1578 states and 2076 transitions. [2025-01-08 22:52:25,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:25,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 128 [2025-01-08 22:52:25,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:25,948 INFO L225 Difference]: With dead ends: 1578 [2025-01-08 22:52:25,949 INFO L226 Difference]: Without dead ends: 921 [2025-01-08 22:52:25,951 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-01-08 22:52:25,951 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:25,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 56 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:52:25,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-01-08 22:52:25,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2025-01-08 22:52:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.275) internal successors, (1173), 920 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:25,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1173 transitions. [2025-01-08 22:52:25,982 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1173 transitions. Word has length 128 [2025-01-08 22:52:25,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:25,983 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1173 transitions. [2025-01-08 22:52:25,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:25,984 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1173 transitions. [2025-01-08 22:52:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-08 22:52:25,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:25,987 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:52:25,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:52:25,988 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:25,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:25,988 INFO L85 PathProgramCache]: Analyzing trace with hash -655828316, now seen corresponding path program 1 times [2025-01-08 22:52:25,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:25,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826554950] [2025-01-08 22:52:25,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:25,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:26,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-08 22:52:26,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-08 22:52:26,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:26,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-08 22:52:26,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:26,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826554950] [2025-01-08 22:52:26,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826554950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:26,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:26,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:52:26,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897278193] [2025-01-08 22:52:26,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:26,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:26,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:26,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:26,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:26,202 INFO L87 Difference]: Start difference. First operand 921 states and 1173 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:26,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:26,607 INFO L93 Difference]: Finished difference Result 1971 states and 2529 transitions. [2025-01-08 22:52:26,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:26,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2025-01-08 22:52:26,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:26,612 INFO L225 Difference]: With dead ends: 1971 [2025-01-08 22:52:26,613 INFO L226 Difference]: Without dead ends: 1183 [2025-01-08 22:52:26,614 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-01-08 22:52:26,615 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 125 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:26,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 74 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:52:26,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-01-08 22:52:26,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 921. [2025-01-08 22:52:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.2619565217391304) internal successors, (1161), 920 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1161 transitions. [2025-01-08 22:52:26,636 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1161 transitions. Word has length 134 [2025-01-08 22:52:26,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:26,636 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1161 transitions. [2025-01-08 22:52:26,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:26,636 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1161 transitions. [2025-01-08 22:52:26,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-08 22:52:26,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:26,639 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:52:26,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:52:26,639 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:26,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:26,640 INFO L85 PathProgramCache]: Analyzing trace with hash -916739783, now seen corresponding path program 1 times [2025-01-08 22:52:26,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:26,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147644303] [2025-01-08 22:52:26,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:26,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:26,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-08 22:52:26,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-08 22:52:26,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:26,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:26,825 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-08 22:52:26,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:26,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147644303] [2025-01-08 22:52:26,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147644303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:26,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:26,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:52:26,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284193190] [2025-01-08 22:52:26,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:26,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:52:26,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:26,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:52:26,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:52:26,827 INFO L87 Difference]: Start difference. First operand 921 states and 1161 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:27,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:27,442 INFO L93 Difference]: Finished difference Result 2364 states and 3001 transitions. [2025-01-08 22:52:27,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:52:27,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 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 148 [2025-01-08 22:52:27,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:27,449 INFO L225 Difference]: With dead ends: 2364 [2025-01-08 22:52:27,449 INFO L226 Difference]: Without dead ends: 1445 [2025-01-08 22:52:27,451 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-01-08 22:52:27,453 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 389 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:27,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 53 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:52:27,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2025-01-08 22:52:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1314. [2025-01-08 22:52:27,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1313 states have (on average 1.2482863670982483) internal successors, (1639), 1313 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:27,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1639 transitions. [2025-01-08 22:52:27,482 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1639 transitions. Word has length 148 [2025-01-08 22:52:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:27,482 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1639 transitions. [2025-01-08 22:52:27,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:27,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1639 transitions. [2025-01-08 22:52:27,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-08 22:52:27,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:27,486 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-01-08 22:52:27,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:52:27,486 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:27,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:27,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1689450080, now seen corresponding path program 1 times [2025-01-08 22:52:27,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:27,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865028631] [2025-01-08 22:52:27,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:27,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:27,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-08 22:52:27,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-08 22:52:27,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:27,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:27,765 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-08 22:52:27,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:27,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865028631] [2025-01-08 22:52:27,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865028631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:27,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:27,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:52:27,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779317978] [2025-01-08 22:52:27,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:27,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:52:27,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:27,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:52:27,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:52:27,767 INFO L87 Difference]: Start difference. First operand 1314 states and 1639 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:28,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:28,357 INFO L93 Difference]: Finished difference Result 3019 states and 3717 transitions. [2025-01-08 22:52:28,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:52:28,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 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 177 [2025-01-08 22:52:28,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:28,363 INFO L225 Difference]: With dead ends: 3019 [2025-01-08 22:52:28,364 INFO L226 Difference]: Without dead ends: 1707 [2025-01-08 22:52:28,365 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-01-08 22:52:28,366 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 353 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:28,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 59 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:52:28,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2025-01-08 22:52:28,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2025-01-08 22:52:28,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.2222222222222223) internal successors, (1925), 1575 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1925 transitions. [2025-01-08 22:52:28,397 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1925 transitions. Word has length 177 [2025-01-08 22:52:28,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:28,397 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 1925 transitions. [2025-01-08 22:52:28,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:28,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1925 transitions. [2025-01-08 22:52:28,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-08 22:52:28,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:28,401 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 3, 3, 3, 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] [2025-01-08 22:52:28,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:52:28,402 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:28,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:28,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1349457016, now seen corresponding path program 1 times [2025-01-08 22:52:28,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:28,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733757298] [2025-01-08 22:52:28,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:28,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:28,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-08 22:52:28,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-08 22:52:28,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:28,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:28,621 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-08 22:52:28,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:28,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733757298] [2025-01-08 22:52:28,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733757298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:28,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:28,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:52:28,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105739649] [2025-01-08 22:52:28,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:28,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:28,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:28,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:28,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:28,625 INFO L87 Difference]: Start difference. First operand 1576 states and 1925 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-01-08 22:52:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:29,048 INFO L93 Difference]: Finished difference Result 3674 states and 4499 transitions. [2025-01-08 22:52:29,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:29,049 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 194 [2025-01-08 22:52:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:29,056 INFO L225 Difference]: With dead ends: 3674 [2025-01-08 22:52:29,056 INFO L226 Difference]: Without dead ends: 2100 [2025-01-08 22:52:29,058 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-01-08 22:52:29,059 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 93 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:29,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 55 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:52:29,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2025-01-08 22:52:29,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1707. [2025-01-08 22:52:29,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.2262602579132473) internal successors, (2092), 1706 states have internal predecessors, (2092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2092 transitions. [2025-01-08 22:52:29,099 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2092 transitions. Word has length 194 [2025-01-08 22:52:29,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:29,101 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 2092 transitions. [2025-01-08 22:52:29,101 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-01-08 22:52:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2092 transitions. [2025-01-08 22:52:29,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-01-08 22:52:29,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:29,106 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 22:52:29,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:52:29,106 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:29,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:29,107 INFO L85 PathProgramCache]: Analyzing trace with hash 329792020, now seen corresponding path program 1 times [2025-01-08 22:52:29,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:29,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967804570] [2025-01-08 22:52:29,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:29,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:29,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-01-08 22:52:29,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-01-08 22:52:29,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:29,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:29,312 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-08 22:52:29,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:29,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967804570] [2025-01-08 22:52:29,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967804570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:29,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:29,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:52:29,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124492727] [2025-01-08 22:52:29,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:29,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:29,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:29,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:29,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:29,314 INFO L87 Difference]: Start difference. First operand 1707 states and 2092 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:29,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:29,726 INFO L93 Difference]: Finished difference Result 3805 states and 4641 transitions. [2025-01-08 22:52:29,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:29,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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-01-08 22:52:29,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:29,734 INFO L225 Difference]: With dead ends: 3805 [2025-01-08 22:52:29,735 INFO L226 Difference]: Without dead ends: 2100 [2025-01-08 22:52:29,737 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-01-08 22:52:29,739 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 86 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:29,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 193 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:52:29,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2025-01-08 22:52:29,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2025-01-08 22:52:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.2022357723577235) internal successors, (2366), 1968 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:29,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2366 transitions. [2025-01-08 22:52:29,797 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2366 transitions. Word has length 243 [2025-01-08 22:52:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:29,797 INFO L471 AbstractCegarLoop]: Abstraction has 1969 states and 2366 transitions. [2025-01-08 22:52:29,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2366 transitions. [2025-01-08 22:52:29,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-01-08 22:52:29,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:29,803 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-01-08 22:52:29,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:52:29,803 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:29,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:29,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2094536488, now seen corresponding path program 1 times [2025-01-08 22:52:29,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:29,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376062314] [2025-01-08 22:52:29,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:29,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:29,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-01-08 22:52:29,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-01-08 22:52:29,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:29,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-01-08 22:52:29,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:29,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376062314] [2025-01-08 22:52:29,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376062314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:29,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:29,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:52:29,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562800142] [2025-01-08 22:52:29,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:29,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:29,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:29,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:29,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:29,942 INFO L87 Difference]: Start difference. First operand 1969 states and 2366 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:30,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:30,328 INFO L93 Difference]: Finished difference Result 3936 states and 4730 transitions. [2025-01-08 22:52:30,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:30,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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 256 [2025-01-08 22:52:30,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:30,336 INFO L225 Difference]: With dead ends: 3936 [2025-01-08 22:52:30,336 INFO L226 Difference]: Without dead ends: 1969 [2025-01-08 22:52:30,339 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-01-08 22:52:30,339 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 98 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:30,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 178 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:52:30,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2025-01-08 22:52:30,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2025-01-08 22:52:30,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.1565040650406504) internal successors, (2276), 1968 states have internal predecessors, (2276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2276 transitions. [2025-01-08 22:52:30,379 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2276 transitions. Word has length 256 [2025-01-08 22:52:30,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:30,379 INFO L471 AbstractCegarLoop]: Abstraction has 1969 states and 2276 transitions. [2025-01-08 22:52:30,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:30,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2276 transitions. [2025-01-08 22:52:30,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-01-08 22:52:30,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:30,385 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2025-01-08 22:52:30,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:52:30,385 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:30,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:30,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1258144963, now seen corresponding path program 1 times [2025-01-08 22:52:30,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:30,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015082179] [2025-01-08 22:52:30,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:30,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:30,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-01-08 22:52:30,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-01-08 22:52:30,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:30,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:30,685 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 188 proven. 112 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-08 22:52:30,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:30,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015082179] [2025-01-08 22:52:30,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015082179] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:52:30,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22752698] [2025-01-08 22:52:30,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:30,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:52:30,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:52:30,690 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:52:30,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:52:30,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-01-08 22:52:30,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-01-08 22:52:30,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:30,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:30,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:52:30,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:52:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-01-08 22:52:31,083 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:52:31,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22752698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:31,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:52:31,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-08 22:52:31,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155171201] [2025-01-08 22:52:31,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:31,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:31,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:31,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:31,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:52:31,085 INFO L87 Difference]: Start difference. First operand 1969 states and 2276 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:31,495 INFO L93 Difference]: Finished difference Result 4460 states and 5195 transitions. [2025-01-08 22:52:31,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:31,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 265 [2025-01-08 22:52:31,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:31,506 INFO L225 Difference]: With dead ends: 4460 [2025-01-08 22:52:31,507 INFO L226 Difference]: Without dead ends: 2493 [2025-01-08 22:52:31,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:52:31,510 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 45 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:31,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 193 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:52:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2025-01-08 22:52:31,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2493. [2025-01-08 22:52:31,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2493 states, 2492 states have (on average 1.1500802568218298) internal successors, (2866), 2492 states have internal predecessors, (2866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:31,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2866 transitions. [2025-01-08 22:52:31,559 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 2866 transitions. Word has length 265 [2025-01-08 22:52:31,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:31,559 INFO L471 AbstractCegarLoop]: Abstraction has 2493 states and 2866 transitions. [2025-01-08 22:52:31,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:31,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2866 transitions. [2025-01-08 22:52:31,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-01-08 22:52:31,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:31,566 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-01-08 22:52:31,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:52:31,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-08 22:52:31,768 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:31,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:31,769 INFO L85 PathProgramCache]: Analyzing trace with hash 164530543, now seen corresponding path program 1 times [2025-01-08 22:52:31,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:31,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38333623] [2025-01-08 22:52:31,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:31,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:31,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-01-08 22:52:31,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-01-08 22:52:31,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:31,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 182 proven. 103 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-08 22:52:32,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:32,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38333623] [2025-01-08 22:52:32,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38333623] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:52:32,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831191623] [2025-01-08 22:52:32,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:32,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:52:32,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:52:32,380 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:52:32,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:52:32,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-01-08 22:52:32,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-01-08 22:52:32,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:32,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:32,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:52:32,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:52:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-01-08 22:52:32,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:52:32,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831191623] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:32,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:52:32,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 22:52:32,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851301641] [2025-01-08 22:52:32,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:32,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:32,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:32,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:32,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:52:32,667 INFO L87 Difference]: Start difference. First operand 2493 states and 2866 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:33,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:33,080 INFO L93 Difference]: Finished difference Result 4851 states and 5525 transitions. [2025-01-08 22:52:33,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:33,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 278 [2025-01-08 22:52:33,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:33,081 INFO L225 Difference]: With dead ends: 4851 [2025-01-08 22:52:33,081 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 22:52:33,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:52:33,086 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 62 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:33,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 28 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:52:33,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 22:52:33,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 22:52:33,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 22:52:33,087 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 278 [2025-01-08 22:52:33,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:33,087 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 22:52:33,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:33,088 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 22:52:33,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 22:52:33,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:52:33,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 22:52:33,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:52:33,300 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:52:33,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 22:52:33,586 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:52:33,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:52:33 BoogieIcfgContainer [2025-01-08 22:52:33,601 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:52:33,601 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:52:33,601 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:52:33,602 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:52:33,602 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:52:22" (3/4) ... [2025-01-08 22:52:33,605 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 22:52:33,623 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 22:52:33,627 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 22:52:33,628 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 22:52:33,629 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 22:52:33,754 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 22:52:33,754 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 22:52:33,754 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:52:33,755 INFO L158 Benchmark]: Toolchain (without parser) took 13253.53ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 106.3MB in the beginning and 154.6MB in the end (delta: -48.3MB). Peak memory consumption was 162.7MB. Max. memory is 16.1GB. [2025-01-08 22:52:33,755 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:52:33,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.14ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 79.1MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 22:52:33,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.43ms. Allocated memory is still 142.6MB. Free memory was 79.1MB in the beginning and 73.8MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:52:33,757 INFO L158 Benchmark]: Boogie Preprocessor took 85.69ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 68.5MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:52:33,757 INFO L158 Benchmark]: RCFGBuilder took 1201.51ms. Allocated memory is still 142.6MB. Free memory was 68.5MB in the beginning and 54.3MB in the end (delta: 14.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-08 22:52:33,757 INFO L158 Benchmark]: TraceAbstraction took 11219.41ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 53.6MB in the beginning and 167.1MB in the end (delta: -113.5MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. [2025-01-08 22:52:33,758 INFO L158 Benchmark]: Witness Printer took 152.79ms. Allocated memory is still 352.3MB. Free memory was 167.1MB in the beginning and 154.6MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 22:52:33,760 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.34ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.14ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 79.1MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.43ms. Allocated memory is still 142.6MB. Free memory was 79.1MB in the beginning and 73.8MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.69ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 68.5MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1201.51ms. Allocated memory is still 142.6MB. Free memory was 68.5MB in the beginning and 54.3MB in the end (delta: 14.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11219.41ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 53.6MB in the beginning and 167.1MB in the end (delta: -113.5MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. * Witness Printer took 152.79ms. Allocated memory is still 352.3MB. Free memory was 167.1MB in the beginning and 154.6MB in the end (delta: 12.5MB). 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: 468]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 12, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1634 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1634 mSDsluCounter, 1028 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 752 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4416 IncrementalHoareTripleChecker+Invalid, 5168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 752 mSolverCounterUnsat, 957 mSDtfsCounter, 4416 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 576 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2493occurred in iteration=11, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 1310 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2661 NumberOfCodeBlocks, 2661 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2647 ConstructedInterpolants, 0 QuantifiedInterpolants, 7606 SizeOfPredicates, 0 NumberOfNonLiveVariables, 937 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2444/2659 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: 593]: Loop Invariant Derived loop invariant: (((((((a21 <= 0) && (a20 == 1)) || (((a21 <= 0) && (a17 == 1)) && (a16 <= 5))) || (((a20 != 1) && (14 <= a8)) && (a16 <= 5))) || (((a20 != 1) && (a7 != 1)) && (a16 <= 5))) || (((a20 != 1) && (a16 == 6)) && (15 <= a8))) || ((a21 == 1) && (a20 == 1))) RESULT: Ultimate proved your program to be correct! [2025-01-08 22:52:33,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE