./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label34.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/Problem16_label34.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 b73f5e5720d5add681fe921396017c2afeb1ab5358e7e5b4cdea0c074172c3d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:07:46,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:07:46,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:07:46,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:07:46,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:07:46,767 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:07:46,768 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:07:46,768 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:07:46,769 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:07:46,769 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:07:46,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:07:46,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:07:46,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:07:46,770 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:07:46,770 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:07:46,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:07:46,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:07:46,771 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:07:46,771 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:07:46,771 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:07:46,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:07:46,771 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:07:46,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:07:46,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:07:46,771 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:07:46,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:07:46,771 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:07:46,772 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:07:46,772 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:07:46,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:07:46,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:07:46,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:07:46,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:07:46,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:07:46,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:07:46,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:07:46,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:07:46,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:07:46,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:07:46,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:07:46,773 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:07:46,773 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:07:46,773 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:07:46,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:07:46,773 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:07:46,773 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:07:46,774 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:07:46,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:07:46,774 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 -> b73f5e5720d5add681fe921396017c2afeb1ab5358e7e5b4cdea0c074172c3d1 [2025-01-09 00:07:47,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:07:47,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:07:47,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:07:47,039 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:07:47,039 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:07:47,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label34.c [2025-01-09 00:07:48,174 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bdefdef29/7b685886fd524ff48086751100037b20/FLAG1996b9472 [2025-01-09 00:07:48,551 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:07:48,551 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label34.c [2025-01-09 00:07:48,571 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bdefdef29/7b685886fd524ff48086751100037b20/FLAG1996b9472 [2025-01-09 00:07:48,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bdefdef29/7b685886fd524ff48086751100037b20 [2025-01-09 00:07:48,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:07:48,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:07:48,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:07:48,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:07:48,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:07:48,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:07:48" (1/1) ... [2025-01-09 00:07:48,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a21f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:48, skipping insertion in model container [2025-01-09 00:07:48,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:07:48" (1/1) ... [2025-01-09 00:07:48,805 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:07:48,949 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/Problem16_label34.c[3712,3725] [2025-01-09 00:07:49,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:07:49,243 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:07:49,254 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/Problem16_label34.c[3712,3725] [2025-01-09 00:07:49,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:07:49,395 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:07:49,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:49 WrapperNode [2025-01-09 00:07:49,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:07:49,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:07:49,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:07:49,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:07:49,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:49" (1/1) ... [2025-01-09 00:07:49,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:49" (1/1) ... [2025-01-09 00:07:49,553 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-01-09 00:07:49,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:07:49,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:07:49,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:07:49,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:07:49,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:49" (1/1) ... [2025-01-09 00:07:49,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:49" (1/1) ... [2025-01-09 00:07:49,584 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:49" (1/1) ... [2025-01-09 00:07:49,620 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 00:07:49,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:49" (1/1) ... [2025-01-09 00:07:49,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:49" (1/1) ... [2025-01-09 00:07:49,657 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:49" (1/1) ... [2025-01-09 00:07:49,662 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:49" (1/1) ... [2025-01-09 00:07:49,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:49" (1/1) ... [2025-01-09 00:07:49,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:49" (1/1) ... [2025-01-09 00:07:49,695 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:49" (1/1) ... [2025-01-09 00:07:49,710 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:07:49,712 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:07:49,712 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:07:49,712 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:07:49,713 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:49" (1/1) ... [2025-01-09 00:07:49,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:07:49,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:07:49,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:07:49,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:07:49,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:07:49,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:07:49,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:07:49,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:07:49,819 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:07:49,820 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:07:51,506 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-01-09 00:07:51,507 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:07:51,521 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:07:51,521 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:07:51,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:07:51 BoogieIcfgContainer [2025-01-09 00:07:51,522 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:07:51,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:07:51,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:07:51,528 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:07:51,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:07:48" (1/3) ... [2025-01-09 00:07:51,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517f958c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:07:51, skipping insertion in model container [2025-01-09 00:07:51,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:49" (2/3) ... [2025-01-09 00:07:51,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517f958c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:07:51, skipping insertion in model container [2025-01-09 00:07:51,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:07:51" (3/3) ... [2025-01-09 00:07:51,531 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label34.c [2025-01-09 00:07:51,542 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:07:51,545 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label34.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:07:51,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:07:51,613 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;@17dccb4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:07:51,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:07:51,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 00:07:51,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:51,631 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] [2025-01-09 00:07:51,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:51,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:51,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1410235526, now seen corresponding path program 1 times [2025-01-09 00:07:51,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:51,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957850110] [2025-01-09 00:07:51,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:51,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:51,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 00:07:51,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 00:07:51,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:51,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:07:51,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:51,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957850110] [2025-01-09 00:07:51,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957850110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:51,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:51,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:52,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769881599] [2025-01-09 00:07:52,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:52,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:07:52,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:52,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:07:52,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:07:52,023 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 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 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:54,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:54,295 INFO L93 Difference]: Finished difference Result 1456 states and 2760 transitions. [2025-01-09 00:07:54,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:07:54,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2025-01-09 00:07:54,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:54,316 INFO L225 Difference]: With dead ends: 1456 [2025-01-09 00:07:54,317 INFO L226 Difference]: Without dead ends: 991 [2025-01-09 00:07:54,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:07:54,328 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 1087 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:54,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 96 Invalid, 2391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:07:54,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2025-01-09 00:07:54,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2025-01-09 00:07:54,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 1.497979797979798) internal successors, (1483), 990 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1483 transitions. [2025-01-09 00:07:54,408 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1483 transitions. Word has length 34 [2025-01-09 00:07:54,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:54,408 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1483 transitions. [2025-01-09 00:07:54,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1483 transitions. [2025-01-09 00:07:54,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-01-09 00:07:54,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:54,418 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:07:54,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:07:54,418 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:54,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:54,419 INFO L85 PathProgramCache]: Analyzing trace with hash -481334510, now seen corresponding path program 1 times [2025-01-09 00:07:54,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:54,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917014743] [2025-01-09 00:07:54,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:54,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:54,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 00:07:54,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 00:07:54,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:54,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:07:54,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:54,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917014743] [2025-01-09 00:07:54,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917014743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:54,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:54,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:54,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757065782] [2025-01-09 00:07:54,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:54,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:54,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:54,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:54,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:54,790 INFO L87 Difference]: Start difference. First operand 991 states and 1483 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:55,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:55,838 INFO L93 Difference]: Finished difference Result 1980 states and 3168 transitions. [2025-01-09 00:07:55,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:55,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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 224 [2025-01-09 00:07:55,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:55,843 INFO L225 Difference]: With dead ends: 1980 [2025-01-09 00:07:55,843 INFO L226 Difference]: Without dead ends: 1320 [2025-01-09 00:07:55,845 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-09 00:07:55,846 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 279 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:55,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 539 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:07:55,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-01-09 00:07:55,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-01-09 00:07:55,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.423805913570887) internal successors, (1878), 1319 states have internal predecessors, (1878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1878 transitions. [2025-01-09 00:07:55,883 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1878 transitions. Word has length 224 [2025-01-09 00:07:55,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:55,885 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1878 transitions. [2025-01-09 00:07:55,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:55,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1878 transitions. [2025-01-09 00:07:55,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-09 00:07:55,892 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:55,892 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-09 00:07:55,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:07:55,892 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:55,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:55,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1436438463, now seen corresponding path program 1 times [2025-01-09 00:07:55,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:55,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440076107] [2025-01-09 00:07:55,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:55,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:55,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 00:07:55,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 00:07:55,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:55,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:56,146 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-01-09 00:07:56,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:56,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440076107] [2025-01-09 00:07:56,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440076107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:56,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:56,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:07:56,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654305860] [2025-01-09 00:07:56,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:56,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:56,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:56,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:56,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:56,149 INFO L87 Difference]: Start difference. First operand 1320 states and 1878 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:57,264 INFO L93 Difference]: Finished difference Result 3296 states and 4947 transitions. [2025-01-09 00:07:57,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:57,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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 227 [2025-01-09 00:07:57,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:57,271 INFO L225 Difference]: With dead ends: 3296 [2025-01-09 00:07:57,271 INFO L226 Difference]: Without dead ends: 1978 [2025-01-09 00:07:57,273 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-09 00:07:57,274 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 339 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:57,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 156 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:07:57,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2025-01-09 00:07:57,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1978. [2025-01-09 00:07:57,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1978 states, 1977 states have (on average 1.1335356600910471) internal successors, (2241), 1977 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2241 transitions. [2025-01-09 00:07:57,304 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2241 transitions. Word has length 227 [2025-01-09 00:07:57,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:57,305 INFO L471 AbstractCegarLoop]: Abstraction has 1978 states and 2241 transitions. [2025-01-09 00:07:57,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:57,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2241 transitions. [2025-01-09 00:07:57,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-01-09 00:07:57,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:57,308 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:07:57,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:07:57,308 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:57,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:57,309 INFO L85 PathProgramCache]: Analyzing trace with hash 433273470, now seen corresponding path program 1 times [2025-01-09 00:07:57,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:57,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919390939] [2025-01-09 00:07:57,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:57,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:57,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-01-09 00:07:57,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-01-09 00:07:57,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:57,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-01-09 00:07:57,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:57,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919390939] [2025-01-09 00:07:57,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919390939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:57,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:57,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:07:57,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369335584] [2025-01-09 00:07:57,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:57,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:57,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:57,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:57,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:57,515 INFO L87 Difference]: Start difference. First operand 1978 states and 2241 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:58,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:58,183 INFO L93 Difference]: Finished difference Result 3954 states and 4508 transitions. [2025-01-09 00:07:58,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:58,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 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 353 [2025-01-09 00:07:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:58,190 INFO L225 Difference]: With dead ends: 3954 [2025-01-09 00:07:58,190 INFO L226 Difference]: Without dead ends: 2307 [2025-01-09 00:07:58,192 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-09 00:07:58,192 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 262 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:58,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 31 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:07:58,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-01-09 00:07:58,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-01-09 00:07:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.092801387684302) internal successors, (2520), 2306 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 2520 transitions. [2025-01-09 00:07:58,225 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 2520 transitions. Word has length 353 [2025-01-09 00:07:58,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:58,225 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 2520 transitions. [2025-01-09 00:07:58,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:58,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 2520 transitions. [2025-01-09 00:07:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2025-01-09 00:07:58,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:58,232 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:07:58,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:07:58,233 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:58,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:58,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1364766448, now seen corresponding path program 1 times [2025-01-09 00:07:58,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:58,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269266718] [2025-01-09 00:07:58,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:58,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:58,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes. [2025-01-09 00:07:58,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements. [2025-01-09 00:07:58,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:58,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-01-09 00:07:58,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:58,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269266718] [2025-01-09 00:07:58,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269266718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:58,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:58,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:58,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860095692] [2025-01-09 00:07:58,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:58,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:58,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:58,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:58,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:58,709 INFO L87 Difference]: Start difference. First operand 2307 states and 2520 transitions. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:59,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:59,420 INFO L93 Difference]: Finished difference Result 5928 states and 6509 transitions. [2025-01-09 00:07:59,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:59,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 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 611 [2025-01-09 00:07:59,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:59,432 INFO L225 Difference]: With dead ends: 5928 [2025-01-09 00:07:59,432 INFO L226 Difference]: Without dead ends: 3952 [2025-01-09 00:07:59,435 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-09 00:07:59,435 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 219 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:59,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 428 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:07:59,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2025-01-09 00:07:59,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3623. [2025-01-09 00:07:59,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3623 states, 3622 states have (on average 1.0668139149641083) internal successors, (3864), 3622 states have internal predecessors, (3864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 3864 transitions. [2025-01-09 00:07:59,487 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 3864 transitions. Word has length 611 [2025-01-09 00:07:59,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:59,488 INFO L471 AbstractCegarLoop]: Abstraction has 3623 states and 3864 transitions. [2025-01-09 00:07:59,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:59,488 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 3864 transitions. [2025-01-09 00:07:59,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2025-01-09 00:07:59,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:59,497 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:07:59,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:07:59,497 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:59,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:59,498 INFO L85 PathProgramCache]: Analyzing trace with hash 187975193, now seen corresponding path program 1 times [2025-01-09 00:07:59,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:59,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306125728] [2025-01-09 00:07:59,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:59,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:59,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes. [2025-01-09 00:07:59,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements. [2025-01-09 00:07:59,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:59,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 711 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-01-09 00:07:59,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:59,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306125728] [2025-01-09 00:07:59,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306125728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:59,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:59,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:59,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380341289] [2025-01-09 00:07:59,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:59,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:59,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:59,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:59,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:59,986 INFO L87 Difference]: Start difference. First operand 3623 states and 3864 transitions. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:00,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:00,736 INFO L93 Difference]: Finished difference Result 8560 states and 9237 transitions. [2025-01-09 00:08:00,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:00,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 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 674 [2025-01-09 00:08:00,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:00,750 INFO L225 Difference]: With dead ends: 8560 [2025-01-09 00:08:00,750 INFO L226 Difference]: Without dead ends: 5268 [2025-01-09 00:08:00,754 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-09 00:08:00,754 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 171 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:00,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 432 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:08:00,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2025-01-09 00:08:00,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 5268. [2025-01-09 00:08:00,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5268 states, 5267 states have (on average 1.0569584203531421) internal successors, (5567), 5267 states have internal predecessors, (5567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:00,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 5567 transitions. [2025-01-09 00:08:00,833 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 5567 transitions. Word has length 674 [2025-01-09 00:08:00,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:00,834 INFO L471 AbstractCegarLoop]: Abstraction has 5268 states and 5567 transitions. [2025-01-09 00:08:00,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:00,834 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 5567 transitions. [2025-01-09 00:08:00,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2025-01-09 00:08:00,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:00,848 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09 00:08:00,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:08:00,848 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:00,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:00,849 INFO L85 PathProgramCache]: Analyzing trace with hash 326876564, now seen corresponding path program 1 times [2025-01-09 00:08:00,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:00,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147259403] [2025-01-09 00:08:00,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:00,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:00,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-01-09 00:08:00,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-01-09 00:08:00,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:00,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 441 proven. 3 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2025-01-09 00:08:01,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:01,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147259403] [2025-01-09 00:08:01,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147259403] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:08:01,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584666113] [2025-01-09 00:08:01,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:01,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:01,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:08:01,687 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:08:01,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:08:01,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-01-09 00:08:01,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-01-09 00:08:01,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:01,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:01,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:08:01,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:08:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2025-01-09 00:08:02,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:08:02,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584666113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:02,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:08:02,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 00:08:02,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67424333] [2025-01-09 00:08:02,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:02,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:02,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:02,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:02,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:08:02,173 INFO L87 Difference]: Start difference. First operand 5268 states and 5567 transitions. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:02,866 INFO L93 Difference]: Finished difference Result 10205 states and 10801 transitions. [2025-01-09 00:08:02,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:02,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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 699 [2025-01-09 00:08:02,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:02,879 INFO L225 Difference]: With dead ends: 10205 [2025-01-09 00:08:02,879 INFO L226 Difference]: Without dead ends: 5268 [2025-01-09 00:08:02,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 699 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:08:02,885 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 258 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:02,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 377 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:08:02,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2025-01-09 00:08:02,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 5268. [2025-01-09 00:08:02,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5268 states, 5267 states have (on average 1.0487943801025252) internal successors, (5524), 5267 states have internal predecessors, (5524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 5524 transitions. [2025-01-09 00:08:02,946 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 5524 transitions. Word has length 699 [2025-01-09 00:08:02,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:02,946 INFO L471 AbstractCegarLoop]: Abstraction has 5268 states and 5524 transitions. [2025-01-09 00:08:02,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:02,947 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 5524 transitions. [2025-01-09 00:08:02,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2025-01-09 00:08:02,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:02,954 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09 00:08:02,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:08:03,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:03,158 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:03,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:03,159 INFO L85 PathProgramCache]: Analyzing trace with hash 51016140, now seen corresponding path program 1 times [2025-01-09 00:08:03,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:03,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892514551] [2025-01-09 00:08:03,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:03,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:03,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 819 statements into 1 equivalence classes. [2025-01-09 00:08:03,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 819 of 819 statements. [2025-01-09 00:08:03,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:03,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 909 proven. 0 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2025-01-09 00:08:03,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:03,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892514551] [2025-01-09 00:08:03,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892514551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:03,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:03,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:03,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825491643] [2025-01-09 00:08:03,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:03,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:03,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:03,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:03,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:08:03,817 INFO L87 Difference]: Start difference. First operand 5268 states and 5524 transitions. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:04,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:04,581 INFO L93 Difference]: Finished difference Result 11850 states and 12502 transitions. [2025-01-09 00:08:04,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:04,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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 819 [2025-01-09 00:08:04,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:04,603 INFO L225 Difference]: With dead ends: 11850 [2025-01-09 00:08:04,603 INFO L226 Difference]: Without dead ends: 6913 [2025-01-09 00:08:04,610 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-09 00:08:04,610 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 233 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:04,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 81 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:08:04,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6913 states. [2025-01-09 00:08:04,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6913 to 6584. [2025-01-09 00:08:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6584 states, 6583 states have (on average 1.0431414248822726) internal successors, (6867), 6583 states have internal predecessors, (6867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6584 states to 6584 states and 6867 transitions. [2025-01-09 00:08:04,714 INFO L78 Accepts]: Start accepts. Automaton has 6584 states and 6867 transitions. Word has length 819 [2025-01-09 00:08:04,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:04,714 INFO L471 AbstractCegarLoop]: Abstraction has 6584 states and 6867 transitions. [2025-01-09 00:08:04,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:04,715 INFO L276 IsEmpty]: Start isEmpty. Operand 6584 states and 6867 transitions. [2025-01-09 00:08:04,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1143 [2025-01-09 00:08:04,725 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:04,726 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:08:04,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:08:04,726 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:04,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:04,727 INFO L85 PathProgramCache]: Analyzing trace with hash 277785056, now seen corresponding path program 1 times [2025-01-09 00:08:04,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:04,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470547578] [2025-01-09 00:08:04,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:04,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:04,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1142 statements into 1 equivalence classes. [2025-01-09 00:08:04,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1142 of 1142 statements. [2025-01-09 00:08:04,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:04,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2694 backedges. 1469 proven. 0 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-01-09 00:08:05,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:05,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470547578] [2025-01-09 00:08:05,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470547578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:05,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:05,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:05,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845842888] [2025-01-09 00:08:05,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:05,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:05,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:05,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:05,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:08:05,691 INFO L87 Difference]: Start difference. First operand 6584 states and 6867 transitions. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:06,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:06,384 INFO L93 Difference]: Finished difference Result 14153 states and 14797 transitions. [2025-01-09 00:08:06,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:06,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 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 1142 [2025-01-09 00:08:06,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:06,408 INFO L225 Difference]: With dead ends: 14153 [2025-01-09 00:08:06,408 INFO L226 Difference]: Without dead ends: 7900 [2025-01-09 00:08:06,415 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-09 00:08:06,417 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:06,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 439 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:08:06,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2025-01-09 00:08:06,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7571. [2025-01-09 00:08:06,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7571 states, 7570 states have (on average 1.038441215323646) internal successors, (7861), 7570 states have internal predecessors, (7861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 7861 transitions. [2025-01-09 00:08:06,506 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 7861 transitions. Word has length 1142 [2025-01-09 00:08:06,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:06,507 INFO L471 AbstractCegarLoop]: Abstraction has 7571 states and 7861 transitions. [2025-01-09 00:08:06,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:06,507 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 7861 transitions. [2025-01-09 00:08:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1161 [2025-01-09 00:08:06,519 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:06,520 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:08:06,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:08:06,520 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:06,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:06,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1112695829, now seen corresponding path program 1 times [2025-01-09 00:08:06,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:06,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044069299] [2025-01-09 00:08:06,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:06,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:06,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1160 statements into 1 equivalence classes. [2025-01-09 00:08:06,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1160 of 1160 statements. [2025-01-09 00:08:06,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:06,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:07,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2025-01-09 00:08:07,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:07,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044069299] [2025-01-09 00:08:07,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044069299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:07,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:07,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:07,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771566555] [2025-01-09 00:08:07,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:07,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:07,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:07,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:07,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:08:07,162 INFO L87 Difference]: Start difference. First operand 7571 states and 7861 transitions. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:07,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:07,922 INFO L93 Difference]: Finished difference Result 15798 states and 16386 transitions. [2025-01-09 00:08:07,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:07,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 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 1160 [2025-01-09 00:08:07,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:07,937 INFO L225 Difference]: With dead ends: 15798 [2025-01-09 00:08:07,937 INFO L226 Difference]: Without dead ends: 7571 [2025-01-09 00:08:07,945 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-09 00:08:07,946 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 172 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:07,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 410 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:08:07,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2025-01-09 00:08:08,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7571. [2025-01-09 00:08:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7571 states, 7570 states have (on average 1.0270805812417436) internal successors, (7775), 7570 states have internal predecessors, (7775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:08,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 7775 transitions. [2025-01-09 00:08:08,052 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 7775 transitions. Word has length 1160 [2025-01-09 00:08:08,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:08,053 INFO L471 AbstractCegarLoop]: Abstraction has 7571 states and 7775 transitions. [2025-01-09 00:08:08,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:08,053 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 7775 transitions. [2025-01-09 00:08:08,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1469 [2025-01-09 00:08:08,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:08,081 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2025-01-09 00:08:08,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:08:08,081 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:08,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:08,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1356204096, now seen corresponding path program 1 times [2025-01-09 00:08:08,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:08,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125157425] [2025-01-09 00:08:08,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:08,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:08,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1468 statements into 1 equivalence classes. [2025-01-09 00:08:08,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1468 of 1468 statements. [2025-01-09 00:08:08,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:08,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2675 proven. 0 refuted. 0 times theorem prover too weak. 1022 trivial. 0 not checked. [2025-01-09 00:08:09,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:09,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125157425] [2025-01-09 00:08:09,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125157425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:09,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:09,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:08:09,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152147325] [2025-01-09 00:08:09,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:09,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:08:09,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:09,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:08:09,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:08:09,389 INFO L87 Difference]: Start difference. First operand 7571 states and 7775 transitions. Second operand has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:10,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:10,255 INFO L93 Difference]: Finished difference Result 14817 states and 15223 transitions. [2025-01-09 00:08:10,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:08:10,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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 1468 [2025-01-09 00:08:10,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:10,267 INFO L225 Difference]: With dead ends: 14817 [2025-01-09 00:08:10,267 INFO L226 Difference]: Without dead ends: 7577 [2025-01-09 00:08:10,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:08:10,274 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:10,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 439 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:08:10,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7577 states. [2025-01-09 00:08:10,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7577 to 7571. [2025-01-09 00:08:10,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7571 states, 7570 states have (on average 1.0268163804491413) internal successors, (7773), 7570 states have internal predecessors, (7773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 7773 transitions. [2025-01-09 00:08:10,334 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 7773 transitions. Word has length 1468 [2025-01-09 00:08:10,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:10,334 INFO L471 AbstractCegarLoop]: Abstraction has 7571 states and 7773 transitions. [2025-01-09 00:08:10,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:10,335 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 7773 transitions. [2025-01-09 00:08:10,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1618 [2025-01-09 00:08:10,352 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:10,353 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:08:10,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:08:10,354 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:10,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:10,355 INFO L85 PathProgramCache]: Analyzing trace with hash -916414638, now seen corresponding path program 1 times [2025-01-09 00:08:10,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:10,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284560151] [2025-01-09 00:08:10,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:10,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:10,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1617 statements into 1 equivalence classes. [2025-01-09 00:08:10,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1617 of 1617 statements. [2025-01-09 00:08:10,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:10,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:11,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5160 backedges. 1414 proven. 0 refuted. 0 times theorem prover too weak. 3746 trivial. 0 not checked. [2025-01-09 00:08:11,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:11,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284560151] [2025-01-09 00:08:11,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284560151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:11,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:11,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:11,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577625717] [2025-01-09 00:08:11,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:11,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:11,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:11,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:11,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:08:11,107 INFO L87 Difference]: Start difference. First operand 7571 states and 7773 transitions. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:11,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:11,763 INFO L93 Difference]: Finished difference Result 16456 states and 16950 transitions. [2025-01-09 00:08:11,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:11,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 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 1617 [2025-01-09 00:08:11,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:11,779 INFO L225 Difference]: With dead ends: 16456 [2025-01-09 00:08:11,780 INFO L226 Difference]: Without dead ends: 9216 [2025-01-09 00:08:11,788 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-09 00:08:11,789 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 163 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:11,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 429 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:08:11,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2025-01-09 00:08:11,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 8887. [2025-01-09 00:08:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8887 states, 8886 states have (on average 1.0250956560882287) internal successors, (9109), 8886 states have internal predecessors, (9109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:11,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9109 transitions. [2025-01-09 00:08:11,902 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 9109 transitions. Word has length 1617 [2025-01-09 00:08:11,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:11,903 INFO L471 AbstractCegarLoop]: Abstraction has 8887 states and 9109 transitions. [2025-01-09 00:08:11,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:11,903 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 9109 transitions. [2025-01-09 00:08:11,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1700 [2025-01-09 00:08:11,940 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:11,941 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:08:11,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:08:11,941 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:11,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:11,942 INFO L85 PathProgramCache]: Analyzing trace with hash -280810117, now seen corresponding path program 1 times [2025-01-09 00:08:11,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:11,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461906284] [2025-01-09 00:08:11,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:11,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:12,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1699 statements into 1 equivalence classes. [2025-01-09 00:08:12,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1699 of 1699 statements. [2025-01-09 00:08:12,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:12,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5170 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 4883 trivial. 0 not checked. [2025-01-09 00:08:12,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:12,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461906284] [2025-01-09 00:08:12,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461906284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:12,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:12,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:08:12,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272872410] [2025-01-09 00:08:12,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:12,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:08:12,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:12,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:08:12,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:08:12,966 INFO L87 Difference]: Start difference. First operand 8887 states and 9109 transitions. Second operand has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:13,913 INFO L93 Difference]: Finished difference Result 21727 states and 22298 transitions. [2025-01-09 00:08:13,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:08:13,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 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 1699 [2025-01-09 00:08:13,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:13,915 INFO L225 Difference]: With dead ends: 21727 [2025-01-09 00:08:13,915 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:08:13,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:08:13,924 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 633 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:13,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 45 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:08:13,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:08:13,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:08:13,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:13,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:08:13,925 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1699 [2025-01-09 00:08:13,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:13,925 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:08:13,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:13,925 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:08:13,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:08:13,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:08:13,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:08:13,930 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:08:13,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 00:08:14,207 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:08:14,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:08:14 BoogieIcfgContainer [2025-01-09 00:08:14,227 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:08:14,228 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:08:14,228 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:08:14,228 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:08:14,228 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:07:51" (3/4) ... [2025-01-09 00:08:14,230 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 00:08:14,254 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 00:08:14,256 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 00:08:14,257 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 00:08:14,258 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 00:08:14,403 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 00:08:14,403 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 00:08:14,403 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:08:14,404 INFO L158 Benchmark]: Toolchain (without parser) took 25654.46ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 110.7MB in the beginning and 586.8MB in the end (delta: -476.1MB). Peak memory consumption was 551.9MB. Max. memory is 16.1GB. [2025-01-09 00:08:14,404 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:08:14,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 645.74ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 50.7MB in the end (delta: 60.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-09 00:08:14,405 INFO L158 Benchmark]: Boogie Procedure Inliner took 155.68ms. Allocated memory is still 142.6MB. Free memory was 50.7MB in the beginning and 91.9MB in the end (delta: -41.3MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2025-01-09 00:08:14,405 INFO L158 Benchmark]: Boogie Preprocessor took 156.41ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 57.6MB in the end (delta: 34.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 00:08:14,405 INFO L158 Benchmark]: RCFGBuilder took 1809.76ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 57.6MB in the beginning and 193.8MB in the end (delta: -136.2MB). Peak memory consumption was 159.9MB. Max. memory is 16.1GB. [2025-01-09 00:08:14,405 INFO L158 Benchmark]: TraceAbstraction took 22703.46ms. Allocated memory was 427.8MB in the beginning and 1.2GB in the end (delta: 746.6MB). Free memory was 192.8MB in the beginning and 611.7MB in the end (delta: -418.9MB). Peak memory consumption was 325.1MB. Max. memory is 16.1GB. [2025-01-09 00:08:14,405 INFO L158 Benchmark]: Witness Printer took 175.85ms. Allocated memory is still 1.2GB. Free memory was 611.7MB in the beginning and 586.8MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 00:08:14,406 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.31ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 645.74ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 50.7MB in the end (delta: 60.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 155.68ms. Allocated memory is still 142.6MB. Free memory was 50.7MB in the beginning and 91.9MB in the end (delta: -41.3MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 156.41ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 57.6MB in the end (delta: 34.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * RCFGBuilder took 1809.76ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 57.6MB in the beginning and 193.8MB in the end (delta: -136.2MB). Peak memory consumption was 159.9MB. Max. memory is 16.1GB. * TraceAbstraction took 22703.46ms. Allocated memory was 427.8MB in the beginning and 1.2GB in the end (delta: 746.6MB). Free memory was 192.8MB in the beginning and 611.7MB in the end (delta: -418.9MB). Peak memory consumption was 325.1MB. Max. memory is 16.1GB. * Witness Printer took 175.85ms. Allocated memory is still 1.2GB. Free memory was 611.7MB in the beginning and 586.8MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. 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: 119]: 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, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.3s, OverallIterations: 13, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4257 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4257 mSDsluCounter, 3902 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 2160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12128 IncrementalHoareTripleChecker+Invalid, 14288 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2160 mSolverCounterUnsat, 3807 mSDtfsCounter, 12128 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 745 GetRequests, 722 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8887occurred in iteration=12, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 1322 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 11426 NumberOfCodeBlocks, 11426 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 11412 ConstructedInterpolants, 0 QuantifiedInterpolants, 18792 SizeOfPredicates, 0 NumberOfNonLiveVariables, 843 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 24946/24949 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: 1783]: Loop Invariant Derived loop invariant: (((((((((a16 == 9) && (7 == a12)) || ((a16 == 9) && (a18 <= 134))) || (a16 <= 8)) || ((a12 == 9) && (a15 == 3))) || (((a12 <= 5) && (a16 != 9)) && (a16 <= 11))) || ((a12 <= 5) && (a15 <= 3))) || ((a15 <= 3) && (a16 != 9))) || (((a12 == 6) && (a16 != 9)) && (a16 <= 11))) RESULT: Ultimate proved your program to be correct! [2025-01-09 00:08:14,426 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