./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label13.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_label13.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 b9aac8f1352449724c28b7a3bd33388133fcac9f460e7deaf570c372da3d5e49 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:06:19,853 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:06:19,902 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:06:19,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:06:19,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:06:19,919 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:06:19,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:06:19,920 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:06:19,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:06:19,920 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:06:19,920 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:06:19,920 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:06:19,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:06:19,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:06:19,921 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:06:19,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:06:19,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:06:19,921 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:06:19,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:06:19,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:06:19,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:06:19,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:06:19,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:06:19,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:06:19,921 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:06:19,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:06:19,921 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:06:19,921 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:06:19,921 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:06:19,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:06:19,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:06:19,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:06:19,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:06:19,922 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:06:19,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:06:19,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:06:19,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:06:19,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:06:19,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:06:19,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:06:19,922 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:06:19,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:06:19,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:06:19,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:06:19,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:06:19,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:06:19,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:06:19,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:06:19,922 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 -> b9aac8f1352449724c28b7a3bd33388133fcac9f460e7deaf570c372da3d5e49 [2025-01-09 00:06:20,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:06:20,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:06:20,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:06:20,240 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:06:20,240 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:06:20,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label13.c [2025-01-09 00:06:21,409 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9fcba43f/bf5c3f30abed40d6a2ba31c5fb0d6968/FLAG14ab13289 [2025-01-09 00:06:21,785 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:06:21,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label13.c [2025-01-09 00:06:21,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9fcba43f/bf5c3f30abed40d6a2ba31c5fb0d6968/FLAG14ab13289 [2025-01-09 00:06:21,988 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9fcba43f/bf5c3f30abed40d6a2ba31c5fb0d6968 [2025-01-09 00:06:21,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:06:21,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:06:21,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:06:21,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:06:21,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:06:21,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:06:21" (1/1) ... [2025-01-09 00:06:21,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b94d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:21, skipping insertion in model container [2025-01-09 00:06:21,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:06:21" (1/1) ... [2025-01-09 00:06:22,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:06:22,202 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_label13.c[5905,5918] [2025-01-09 00:06:22,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:06:22,426 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:06:22,448 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_label13.c[5905,5918] [2025-01-09 00:06:22,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:06:22,586 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:06:22,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:22 WrapperNode [2025-01-09 00:06:22,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:06:22,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:06:22,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:06:22,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:06:22,594 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:06:22" (1/1) ... [2025-01-09 00:06:22,626 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:06:22" (1/1) ... [2025-01-09 00:06:22,758 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-01-09 00:06:22,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:06:22,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:06:22,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:06:22,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:06:22,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:22" (1/1) ... [2025-01-09 00:06:22,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:22" (1/1) ... [2025-01-09 00:06:22,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:22" (1/1) ... [2025-01-09 00:06:22,826 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:06:22,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:22" (1/1) ... [2025-01-09 00:06:22,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:22" (1/1) ... [2025-01-09 00:06:22,869 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:22" (1/1) ... [2025-01-09 00:06:22,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:22" (1/1) ... [2025-01-09 00:06:22,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:22" (1/1) ... [2025-01-09 00:06:22,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:22" (1/1) ... [2025-01-09 00:06:22,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:22" (1/1) ... [2025-01-09 00:06:22,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:06:22,928 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:06:22,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:06:22,928 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:06:22,929 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:22" (1/1) ... [2025-01-09 00:06:22,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:06:22,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:06:22,951 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:06:22,961 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:06:22,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:06:22,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:06:22,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:06:22,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:06:23,021 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:06:23,023 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:06:24,649 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-01-09 00:06:24,650 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:06:24,664 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:06:24,664 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:06:24,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:06:24 BoogieIcfgContainer [2025-01-09 00:06:24,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:06:24,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:06:24,667 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:06:24,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:06:24,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:06:21" (1/3) ... [2025-01-09 00:06:24,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455783e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:06:24, skipping insertion in model container [2025-01-09 00:06:24,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:22" (2/3) ... [2025-01-09 00:06:24,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455783e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:06:24, skipping insertion in model container [2025-01-09 00:06:24,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:06:24" (3/3) ... [2025-01-09 00:06:24,672 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label13.c [2025-01-09 00:06:24,681 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:06:24,682 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label13.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:06:24,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:06:24,769 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;@7d6c8980, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:06:24,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:06:24,775 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:06:24,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 00:06:24,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:24,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:24,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:24,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:24,788 INFO L85 PathProgramCache]: Analyzing trace with hash 598103698, now seen corresponding path program 1 times [2025-01-09 00:06:24,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:24,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646649906] [2025-01-09 00:06:24,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:24,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:24,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 00:06:24,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 00:06:24,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:24,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:25,114 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:06:25,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:25,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646649906] [2025-01-09 00:06:25,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646649906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:25,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:25,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:06:25,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136898761] [2025-01-09 00:06:25,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:25,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:25,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:25,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:25,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:25,141 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 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 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:06:26,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:26,330 INFO L93 Difference]: Finished difference Result 1122 states and 2100 transitions. [2025-01-09 00:06:26,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:26,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 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 56 [2025-01-09 00:06:26,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:26,340 INFO L225 Difference]: With dead ends: 1122 [2025-01-09 00:06:26,340 INFO L226 Difference]: Without dead ends: 662 [2025-01-09 00:06:26,342 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:06:26,344 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 331 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:26,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 254 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:06:26,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-01-09 00:06:26,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-01-09 00:06:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.518910741301059) internal successors, (1004), 661 states have internal predecessors, (1004), 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:06:26,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1004 transitions. [2025-01-09 00:06:26,389 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1004 transitions. Word has length 56 [2025-01-09 00:06:26,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:26,389 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1004 transitions. [2025-01-09 00:06:26,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 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:06:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1004 transitions. [2025-01-09 00:06:26,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 00:06:26,392 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:26,392 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:06:26,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:06:26,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:26,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:26,393 INFO L85 PathProgramCache]: Analyzing trace with hash 705254892, now seen corresponding path program 1 times [2025-01-09 00:06:26,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:26,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067636730] [2025-01-09 00:06:26,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:26,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:26,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 00:06:26,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 00:06:26,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:26,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:26,705 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:06:26,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:26,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067636730] [2025-01-09 00:06:26,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067636730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:26,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:26,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:26,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028750964] [2025-01-09 00:06:26,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:26,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:06:26,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:26,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:06:26,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:06:26,708 INFO L87 Difference]: Start difference. First operand 662 states and 1004 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:28,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:28,517 INFO L93 Difference]: Finished difference Result 2309 states and 3414 transitions. [2025-01-09 00:06:28,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:06:28,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-01-09 00:06:28,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:28,524 INFO L225 Difference]: With dead ends: 2309 [2025-01-09 00:06:28,525 INFO L226 Difference]: Without dead ends: 1649 [2025-01-09 00:06:28,528 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:06:28,529 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1008 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:28,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 42 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:06:28,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2025-01-09 00:06:28,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2025-01-09 00:06:28,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1648 states have (on average 1.4016990291262137) internal successors, (2310), 1648 states have internal predecessors, (2310), 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:06:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2310 transitions. [2025-01-09 00:06:28,588 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2310 transitions. Word has length 124 [2025-01-09 00:06:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:28,589 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2310 transitions. [2025-01-09 00:06:28,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2310 transitions. [2025-01-09 00:06:28,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 00:06:28,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:28,595 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:28,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:06:28,597 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:28,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:28,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1678720750, now seen corresponding path program 1 times [2025-01-09 00:06:28,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:28,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279093507] [2025-01-09 00:06:28,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:28,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:28,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 00:06:28,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 00:06:28,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:28,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:06:28,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:28,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279093507] [2025-01-09 00:06:28,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279093507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:28,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:28,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:06:28,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386034972] [2025-01-09 00:06:28,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:28,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:28,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:28,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:28,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:28,832 INFO L87 Difference]: Start difference. First operand 1649 states and 2310 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 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:06:30,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:30,493 INFO L93 Difference]: Finished difference Result 3625 states and 5242 transitions. [2025-01-09 00:06:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:30,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 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 187 [2025-01-09 00:06:30,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:30,505 INFO L225 Difference]: With dead ends: 3625 [2025-01-09 00:06:30,505 INFO L226 Difference]: Without dead ends: 2307 [2025-01-09 00:06:30,506 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:06:30,509 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:30,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 77 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:06:30,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-01-09 00:06:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-01-09 00:06:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.349956634865568) internal successors, (3113), 2306 states have internal predecessors, (3113), 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:06:30,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3113 transitions. [2025-01-09 00:06:30,553 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3113 transitions. Word has length 187 [2025-01-09 00:06:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:30,554 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3113 transitions. [2025-01-09 00:06:30,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 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:06:30,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3113 transitions. [2025-01-09 00:06:30,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-01-09 00:06:30,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:30,557 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:30,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:06:30,558 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:30,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:30,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1334665446, now seen corresponding path program 1 times [2025-01-09 00:06:30,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:30,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479277267] [2025-01-09 00:06:30,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:30,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:30,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 00:06:30,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 00:06:30,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:30,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-09 00:06:30,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:30,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479277267] [2025-01-09 00:06:30,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479277267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:30,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:30,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:06:30,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736773545] [2025-01-09 00:06:30,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:30,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:30,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:30,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:30,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:30,812 INFO L87 Difference]: Start difference. First operand 2307 states and 3113 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:31,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:31,807 INFO L93 Difference]: Finished difference Result 5599 states and 7699 transitions. [2025-01-09 00:06:31,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:31,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 222 [2025-01-09 00:06:31,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:31,818 INFO L225 Difference]: With dead ends: 5599 [2025-01-09 00:06:31,818 INFO L226 Difference]: Without dead ends: 3623 [2025-01-09 00:06:31,821 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:06:31,822 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:31,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:06:31,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2025-01-09 00:06:31,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 2965. [2025-01-09 00:06:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2964 states have (on average 1.2442645074224021) internal successors, (3688), 2964 states have internal predecessors, (3688), 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:06:31,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3688 transitions. [2025-01-09 00:06:31,875 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 3688 transitions. Word has length 222 [2025-01-09 00:06:31,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:31,876 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 3688 transitions. [2025-01-09 00:06:31,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:31,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 3688 transitions. [2025-01-09 00:06:31,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-01-09 00:06:31,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:31,878 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:31,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:06:31,879 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:31,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:31,879 INFO L85 PathProgramCache]: Analyzing trace with hash 998921136, now seen corresponding path program 1 times [2025-01-09 00:06:31,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:31,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141041565] [2025-01-09 00:06:31,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:31,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:31,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-01-09 00:06:31,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-01-09 00:06:31,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:31,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:32,060 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:06:32,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:32,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141041565] [2025-01-09 00:06:32,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141041565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:32,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:32,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:32,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849904392] [2025-01-09 00:06:32,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:32,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:32,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:32,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:32,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:32,061 INFO L87 Difference]: Start difference. First operand 2965 states and 3688 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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:06:33,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:33,750 INFO L93 Difference]: Finished difference Result 6915 states and 8657 transitions. [2025-01-09 00:06:33,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:33,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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 239 [2025-01-09 00:06:33,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:33,766 INFO L225 Difference]: With dead ends: 6915 [2025-01-09 00:06:33,766 INFO L226 Difference]: Without dead ends: 3952 [2025-01-09 00:06:33,768 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:06:33,769 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 287 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:33,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 539 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:06:33,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2025-01-09 00:06:33,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2025-01-09 00:06:33,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.0736522399392558) internal successors, (4242), 3951 states have internal predecessors, (4242), 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:06:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4242 transitions. [2025-01-09 00:06:33,815 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4242 transitions. Word has length 239 [2025-01-09 00:06:33,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:33,815 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 4242 transitions. [2025-01-09 00:06:33,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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:06:33,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4242 transitions. [2025-01-09 00:06:33,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-01-09 00:06:33,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:33,818 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:33,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:06:33,819 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:33,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:33,819 INFO L85 PathProgramCache]: Analyzing trace with hash -387378070, now seen corresponding path program 1 times [2025-01-09 00:06:33,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:33,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470525333] [2025-01-09 00:06:33,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:33,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:33,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-01-09 00:06:33,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-01-09 00:06:33,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:33,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:06:34,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:34,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470525333] [2025-01-09 00:06:34,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470525333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:34,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:34,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:34,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045483298] [2025-01-09 00:06:34,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:34,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:34,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:34,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:34,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:34,072 INFO L87 Difference]: Start difference. First operand 3952 states and 4242 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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:06:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:34,785 INFO L93 Difference]: Finished difference Result 9218 states and 9926 transitions. [2025-01-09 00:06:34,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:34,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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 291 [2025-01-09 00:06:34,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:34,797 INFO L225 Difference]: With dead ends: 9218 [2025-01-09 00:06:34,797 INFO L226 Difference]: Without dead ends: 5268 [2025-01-09 00:06:34,801 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:06:34,804 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 281 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:34,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 424 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:06:34,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2025-01-09 00:06:34,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 5268. [2025-01-09 00:06:34,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5268 states, 5267 states have (on average 1.0493639643060566) internal successors, (5527), 5267 states have internal predecessors, (5527), 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:06:34,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 5527 transitions. [2025-01-09 00:06:34,868 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 5527 transitions. Word has length 291 [2025-01-09 00:06:34,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:34,868 INFO L471 AbstractCegarLoop]: Abstraction has 5268 states and 5527 transitions. [2025-01-09 00:06:34,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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:06:34,869 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 5527 transitions. [2025-01-09 00:06:34,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2025-01-09 00:06:34,895 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:34,895 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:34,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:06:34,895 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:34,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:34,896 INFO L85 PathProgramCache]: Analyzing trace with hash 859493354, now seen corresponding path program 1 times [2025-01-09 00:06:34,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:34,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175830176] [2025-01-09 00:06:34,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:34,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:34,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-01-09 00:06:34,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-01-09 00:06:34,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:34,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:35,118 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-01-09 00:06:35,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:35,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175830176] [2025-01-09 00:06:35,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175830176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:35,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:35,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:35,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413355328] [2025-01-09 00:06:35,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:35,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:35,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:35,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:35,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:35,120 INFO L87 Difference]: Start difference. First operand 5268 states and 5527 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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:06:35,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:35,834 INFO L93 Difference]: Finished difference Result 11850 states and 12495 transitions. [2025-01-09 00:06:35,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:35,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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 395 [2025-01-09 00:06:35,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:35,851 INFO L225 Difference]: With dead ends: 11850 [2025-01-09 00:06:35,851 INFO L226 Difference]: Without dead ends: 6584 [2025-01-09 00:06:35,856 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:06:35,856 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 292 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:35,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 39 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:06:35,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6584 states. [2025-01-09 00:06:35,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6584 to 6584. [2025-01-09 00:06:35,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6584 states, 6583 states have (on average 1.052863436123348) internal successors, (6931), 6583 states have internal predecessors, (6931), 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:06:35,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6584 states to 6584 states and 6931 transitions. [2025-01-09 00:06:35,929 INFO L78 Accepts]: Start accepts. Automaton has 6584 states and 6931 transitions. Word has length 395 [2025-01-09 00:06:35,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:35,930 INFO L471 AbstractCegarLoop]: Abstraction has 6584 states and 6931 transitions. [2025-01-09 00:06:35,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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:06:35,930 INFO L276 IsEmpty]: Start isEmpty. Operand 6584 states and 6931 transitions. [2025-01-09 00:06:35,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-01-09 00:06:35,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:35,934 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:35,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:06:35,935 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:35,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:35,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2107875043, now seen corresponding path program 1 times [2025-01-09 00:06:35,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:35,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584487772] [2025-01-09 00:06:35,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:35,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:35,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-01-09 00:06:35,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-01-09 00:06:35,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:35,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:36,222 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-01-09 00:06:36,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:36,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584487772] [2025-01-09 00:06:36,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584487772] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:36,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:36,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:36,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132081570] [2025-01-09 00:06:36,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:36,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:36,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:36,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:36,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:36,224 INFO L87 Difference]: Start difference. First operand 6584 states and 6931 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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:06:36,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:36,957 INFO L93 Difference]: Finished difference Result 14482 states and 15303 transitions. [2025-01-09 00:06:36,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:36,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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 449 [2025-01-09 00:06:36,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:36,980 INFO L225 Difference]: With dead ends: 14482 [2025-01-09 00:06:36,980 INFO L226 Difference]: Without dead ends: 7900 [2025-01-09 00:06:36,985 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:06:36,985 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 276 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:36,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 441 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:06:36,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2025-01-09 00:06:37,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7900. [2025-01-09 00:06:37,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7900 states, 7899 states have (on average 1.0481073553614382) internal successors, (8279), 7899 states have internal predecessors, (8279), 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:06:37,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8279 transitions. [2025-01-09 00:06:37,073 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 8279 transitions. Word has length 449 [2025-01-09 00:06:37,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:37,073 INFO L471 AbstractCegarLoop]: Abstraction has 7900 states and 8279 transitions. [2025-01-09 00:06:37,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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:06:37,073 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 8279 transitions. [2025-01-09 00:06:37,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2025-01-09 00:06:37,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:37,080 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:06:37,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:06:37,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:37,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:37,081 INFO L85 PathProgramCache]: Analyzing trace with hash -371241286, now seen corresponding path program 1 times [2025-01-09 00:06:37,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:37,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171331974] [2025-01-09 00:06:37,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:37,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:37,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes. [2025-01-09 00:06:37,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements. [2025-01-09 00:06:37,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:37,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2025-01-09 00:06:37,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:37,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171331974] [2025-01-09 00:06:37,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171331974] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:06:37,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762630946] [2025-01-09 00:06:37,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:37,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:06:37,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:06:37,531 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:06:37,539 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:06:37,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes. [2025-01-09 00:06:37,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements. [2025-01-09 00:06:37,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:37,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:37,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:06:37,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:06:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 00:06:38,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:06:38,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762630946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:38,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:06:38,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-09 00:06:38,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996211378] [2025-01-09 00:06:38,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:38,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:38,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:38,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:38,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:06:38,229 INFO L87 Difference]: Start difference. First operand 7900 states and 8279 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 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:06:38,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:38,847 INFO L93 Difference]: Finished difference Result 9547 states and 9963 transitions. [2025-01-09 00:06:38,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:38,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 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 510 [2025-01-09 00:06:38,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:38,860 INFO L225 Difference]: With dead ends: 9547 [2025-01-09 00:06:38,861 INFO L226 Difference]: Without dead ends: 9545 [2025-01-09 00:06:38,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:06:38,863 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 116 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:38,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 76 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:06:38,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9545 states. [2025-01-09 00:06:38,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9545 to 8229. [2025-01-09 00:06:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.0477637335926107) internal successors, (8621), 8228 states have internal predecessors, (8621), 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:06:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8621 transitions. [2025-01-09 00:06:38,961 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8621 transitions. Word has length 510 [2025-01-09 00:06:38,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:38,962 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8621 transitions. [2025-01-09 00:06:38,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 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:06:38,963 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8621 transitions. [2025-01-09 00:06:38,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 859 [2025-01-09 00:06:38,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:38,977 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:06:38,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 00:06:39,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:06:39,178 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:39,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:39,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1842873819, now seen corresponding path program 1 times [2025-01-09 00:06:39,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:39,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831795172] [2025-01-09 00:06:39,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:39,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:39,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 858 statements into 1 equivalence classes. [2025-01-09 00:06:39,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 858 of 858 statements. [2025-01-09 00:06:39,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:39,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 952 proven. 0 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2025-01-09 00:06:39,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:39,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831795172] [2025-01-09 00:06:39,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831795172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:39,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:39,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:39,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855548855] [2025-01-09 00:06:39,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:39,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:39,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:39,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:39,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:39,679 INFO L87 Difference]: Start difference. First operand 8229 states and 8621 transitions. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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:06:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:40,356 INFO L93 Difference]: Finished difference Result 16127 states and 16909 transitions. [2025-01-09 00:06:40,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:40,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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 858 [2025-01-09 00:06:40,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:40,368 INFO L225 Difference]: With dead ends: 16127 [2025-01-09 00:06:40,369 INFO L226 Difference]: Without dead ends: 8229 [2025-01-09 00:06:40,374 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:06:40,374 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 222 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:40,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 428 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:06:40,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2025-01-09 00:06:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 8229. [2025-01-09 00:06:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.034637822070977) internal successors, (8513), 8228 states have internal predecessors, (8513), 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:06:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8513 transitions. [2025-01-09 00:06:40,426 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8513 transitions. Word has length 858 [2025-01-09 00:06:40,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:40,427 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8513 transitions. [2025-01-09 00:06:40,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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:06:40,427 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8513 transitions. [2025-01-09 00:06:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 860 [2025-01-09 00:06:40,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:40,435 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:06:40,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:06:40,435 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:40,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:40,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1742190831, now seen corresponding path program 1 times [2025-01-09 00:06:40,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:40,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807512113] [2025-01-09 00:06:40,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:40,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:40,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 859 statements into 1 equivalence classes. [2025-01-09 00:06:40,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 859 of 859 statements. [2025-01-09 00:06:40,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:40,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:41,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1381 backedges. 721 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2025-01-09 00:06:41,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:41,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807512113] [2025-01-09 00:06:41,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807512113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:41,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:41,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:41,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925832231] [2025-01-09 00:06:41,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:41,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:41,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:41,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:41,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:41,077 INFO L87 Difference]: Start difference. First operand 8229 states and 8513 transitions. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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:06:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:41,709 INFO L93 Difference]: Finished difference Result 16127 states and 16693 transitions. [2025-01-09 00:06:41,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:41,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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 859 [2025-01-09 00:06:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:41,721 INFO L225 Difference]: With dead ends: 16127 [2025-01-09 00:06:41,722 INFO L226 Difference]: Without dead ends: 8229 [2025-01-09 00:06:41,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:06:41,728 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 210 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:41,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 37 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:06:41,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2025-01-09 00:06:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 8229. [2025-01-09 00:06:41,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.032328633932912) internal successors, (8494), 8228 states have internal predecessors, (8494), 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:06:41,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8494 transitions. [2025-01-09 00:06:41,845 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8494 transitions. Word has length 859 [2025-01-09 00:06:41,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:41,845 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8494 transitions. [2025-01-09 00:06:41,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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:06:41,845 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8494 transitions. [2025-01-09 00:06:41,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2025-01-09 00:06:41,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:41,852 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:06:41,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:06:41,852 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:41,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:41,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1748209545, now seen corresponding path program 1 times [2025-01-09 00:06:41,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:41,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877144798] [2025-01-09 00:06:41,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:41,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:41,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 887 statements into 1 equivalence classes. [2025-01-09 00:06:41,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 887 of 887 statements. [2025-01-09 00:06:41,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:41,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:42,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 503 proven. 635 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-01-09 00:06:42,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:42,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877144798] [2025-01-09 00:06:42,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877144798] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:06:42,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998150147] [2025-01-09 00:06:42,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:42,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:06:42,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:06:42,692 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:06:42,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 00:06:42,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 887 statements into 1 equivalence classes. [2025-01-09 00:06:42,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 887 of 887 statements. [2025-01-09 00:06:42,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:42,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:42,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:06:42,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:06:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 693 proven. 0 refuted. 0 times theorem prover too weak. 769 trivial. 0 not checked. [2025-01-09 00:06:43,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:06:43,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998150147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:43,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:06:43,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 00:06:43,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417455327] [2025-01-09 00:06:43,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:43,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:43,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:43,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:43,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:06:43,057 INFO L87 Difference]: Start difference. First operand 8229 states and 8494 transitions. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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:06:43,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:43,700 INFO L93 Difference]: Finished difference Result 16127 states and 16655 transitions. [2025-01-09 00:06:43,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:43,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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 887 [2025-01-09 00:06:43,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:43,709 INFO L225 Difference]: With dead ends: 16127 [2025-01-09 00:06:43,710 INFO L226 Difference]: Without dead ends: 8229 [2025-01-09 00:06:43,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 891 GetRequests, 887 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:06:43,715 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 226 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:43,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 377 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:06:43,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2025-01-09 00:06:43,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 8229. [2025-01-09 00:06:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.0279533300923676) internal successors, (8458), 8228 states have internal predecessors, (8458), 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:06:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8458 transitions. [2025-01-09 00:06:43,766 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8458 transitions. Word has length 887 [2025-01-09 00:06:43,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:43,766 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8458 transitions. [2025-01-09 00:06:43,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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:06:43,767 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8458 transitions. [2025-01-09 00:06:43,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1281 [2025-01-09 00:06:43,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:43,778 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, 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, 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, 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, 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] [2025-01-09 00:06:43,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 00:06:43,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:06:43,979 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:43,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:43,979 INFO L85 PathProgramCache]: Analyzing trace with hash 276540867, now seen corresponding path program 1 times [2025-01-09 00:06:43,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:43,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738781248] [2025-01-09 00:06:43,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:43,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:44,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1280 statements into 1 equivalence classes. [2025-01-09 00:06:44,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1280 of 1280 statements. [2025-01-09 00:06:44,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:44,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2994 backedges. 1747 proven. 0 refuted. 0 times theorem prover too weak. 1247 trivial. 0 not checked. [2025-01-09 00:06:44,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:44,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738781248] [2025-01-09 00:06:44,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738781248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:44,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:44,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:44,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002514344] [2025-01-09 00:06:44,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:44,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:44,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:44,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:44,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:44,988 INFO L87 Difference]: Start difference. First operand 8229 states and 8458 transitions. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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:06:45,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:45,696 INFO L93 Difference]: Finished difference Result 17443 states and 17918 transitions. [2025-01-09 00:06:45,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:45,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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 1280 [2025-01-09 00:06:45,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:45,710 INFO L225 Difference]: With dead ends: 17443 [2025-01-09 00:06:45,710 INFO L226 Difference]: Without dead ends: 9545 [2025-01-09 00:06:45,718 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:06:45,719 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:45,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 439 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:06:45,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9545 states. [2025-01-09 00:06:45,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9545 to 9216. [2025-01-09 00:06:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9216 states, 9215 states have (on average 1.025718936516549) internal successors, (9452), 9215 states have internal predecessors, (9452), 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:06:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9452 transitions. [2025-01-09 00:06:45,811 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 9452 transitions. Word has length 1280 [2025-01-09 00:06:45,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:45,812 INFO L471 AbstractCegarLoop]: Abstraction has 9216 states and 9452 transitions. [2025-01-09 00:06:45,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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:06:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 9452 transitions. [2025-01-09 00:06:45,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1299 [2025-01-09 00:06:45,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:45,836 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, 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, 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, 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, 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] [2025-01-09 00:06:45,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:06:45,836 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:45,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:45,837 INFO L85 PathProgramCache]: Analyzing trace with hash -197099698, now seen corresponding path program 1 times [2025-01-09 00:06:45,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:45,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771969451] [2025-01-09 00:06:45,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:45,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:45,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1298 statements into 1 equivalence classes. [2025-01-09 00:06:45,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1298 of 1298 statements. [2025-01-09 00:06:45,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:45,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:46,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3024 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 2647 trivial. 0 not checked. [2025-01-09 00:06:46,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:46,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771969451] [2025-01-09 00:06:46,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771969451] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:46,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:46,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 00:06:46,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854945617] [2025-01-09 00:06:46,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:46,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 00:06:46,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:46,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 00:06:46,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:06:46,708 INFO L87 Difference]: Start difference. First operand 9216 states and 9452 transitions. Second operand has 6 states, 6 states have (on average 58.333333333333336) internal successors, (350), 6 states have internal predecessors, (350), 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:06:47,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:47,294 INFO L93 Difference]: Finished difference Result 18160 states and 18630 transitions. [2025-01-09 00:06:47,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 00:06:47,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.333333333333336) internal successors, (350), 6 states have internal predecessors, (350), 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 1298 [2025-01-09 00:06:47,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:47,304 INFO L225 Difference]: With dead ends: 18160 [2025-01-09 00:06:47,305 INFO L226 Difference]: Without dead ends: 9216 [2025-01-09 00:06:47,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:06:47,312 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 22 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:47,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 460 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:06:47,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2025-01-09 00:06:47,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 9216. [2025-01-09 00:06:47,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9216 states, 9215 states have (on average 1.0250678241996745) internal successors, (9446), 9215 states have internal predecessors, (9446), 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:06:47,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9446 transitions. [2025-01-09 00:06:47,378 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 9446 transitions. Word has length 1298 [2025-01-09 00:06:47,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:47,378 INFO L471 AbstractCegarLoop]: Abstraction has 9216 states and 9446 transitions. [2025-01-09 00:06:47,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.333333333333336) internal successors, (350), 6 states have internal predecessors, (350), 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:06:47,379 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 9446 transitions. [2025-01-09 00:06:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1638 [2025-01-09 00:06:47,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:47,396 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, 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, 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, 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, 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, 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, 1, 1] [2025-01-09 00:06:47,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:06:47,396 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:47,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:47,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1197785922, now seen corresponding path program 1 times [2025-01-09 00:06:47,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:47,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75941799] [2025-01-09 00:06:47,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:47,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:47,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1637 statements into 1 equivalence classes. [2025-01-09 00:06:47,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1637 of 1637 statements. [2025-01-09 00:06:47,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:47,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5090 backedges. 3522 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-01-09 00:06:48,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:48,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75941799] [2025-01-09 00:06:48,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75941799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:48,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:48,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 00:06:48,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082140431] [2025-01-09 00:06:48,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:48,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 00:06:48,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:48,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 00:06:48,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:06:48,797 INFO L87 Difference]: Start difference. First operand 9216 states and 9446 transitions. Second operand has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 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:06:50,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:50,453 INFO L93 Difference]: Finished difference Result 18102 states and 18560 transitions. [2025-01-09 00:06:50,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 00:06:50,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 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 1637 [2025-01-09 00:06:50,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:50,471 INFO L225 Difference]: With dead ends: 18102 [2025-01-09 00:06:50,474 INFO L226 Difference]: Without dead ends: 9217 [2025-01-09 00:06:50,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:06:50,489 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 357 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 1789 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:50,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 563 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1789 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:06:50,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9217 states. [2025-01-09 00:06:50,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9217 to 9216. [2025-01-09 00:06:50,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9216 states, 9215 states have (on average 1.0243081931633207) internal successors, (9439), 9215 states have internal predecessors, (9439), 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:06:50,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9439 transitions. [2025-01-09 00:06:50,626 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 9439 transitions. Word has length 1637 [2025-01-09 00:06:50,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:50,630 INFO L471 AbstractCegarLoop]: Abstraction has 9216 states and 9439 transitions. [2025-01-09 00:06:50,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 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:06:50,630 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 9439 transitions. [2025-01-09 00:06:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1652 [2025-01-09 00:06:50,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:50,666 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 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, 1] [2025-01-09 00:06:50,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:06:50,666 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:50,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:50,667 INFO L85 PathProgramCache]: Analyzing trace with hash 9475573, now seen corresponding path program 1 times [2025-01-09 00:06:50,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:50,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057775767] [2025-01-09 00:06:50,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:50,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:50,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1651 statements into 1 equivalence classes. [2025-01-09 00:06:50,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1651 of 1651 statements. [2025-01-09 00:06:50,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:50,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:52,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4937 backedges. 3406 proven. 0 refuted. 0 times theorem prover too weak. 1531 trivial. 0 not checked. [2025-01-09 00:06:52,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:52,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057775767] [2025-01-09 00:06:52,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057775767] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:52,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:52,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:52,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126845392] [2025-01-09 00:06:52,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:52,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:52,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:52,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:52,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:52,431 INFO L87 Difference]: Start difference. First operand 9216 states and 9439 transitions. Second operand has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 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:06:53,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:53,069 INFO L93 Difference]: Finished difference Result 18101 states and 18545 transitions. [2025-01-09 00:06:53,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:53,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 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 1651 [2025-01-09 00:06:53,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:53,079 INFO L225 Difference]: With dead ends: 18101 [2025-01-09 00:06:53,079 INFO L226 Difference]: Without dead ends: 9216 [2025-01-09 00:06:53,085 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:06:53,086 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 62 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:53,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 432 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:06:53,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2025-01-09 00:06:53,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 9216. [2025-01-09 00:06:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9216 states, 9215 states have (on average 1.0240911557243624) internal successors, (9437), 9215 states have internal predecessors, (9437), 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:06:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9437 transitions. [2025-01-09 00:06:53,145 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 9437 transitions. Word has length 1651 [2025-01-09 00:06:53,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:53,146 INFO L471 AbstractCegarLoop]: Abstraction has 9216 states and 9437 transitions. [2025-01-09 00:06:53,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 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:06:53,146 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 9437 transitions. [2025-01-09 00:06:53,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1745 [2025-01-09 00:06:53,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:53,225 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, 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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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:06:53,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:06:53,225 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:53,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:53,226 INFO L85 PathProgramCache]: Analyzing trace with hash 983625320, now seen corresponding path program 1 times [2025-01-09 00:06:53,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:53,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642540711] [2025-01-09 00:06:53,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:53,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:53,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1744 statements into 1 equivalence classes. [2025-01-09 00:06:53,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1744 of 1744 statements. [2025-01-09 00:06:53,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:53,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5473 backedges. 1727 proven. 0 refuted. 0 times theorem prover too weak. 3746 trivial. 0 not checked. [2025-01-09 00:06:54,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:54,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642540711] [2025-01-09 00:06:54,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642540711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:54,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:54,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:06:54,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775795650] [2025-01-09 00:06:54,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:54,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:06:54,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:54,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:06:54,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:06:54,799 INFO L87 Difference]: Start difference. First operand 9216 states and 9437 transitions. Second operand has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 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:06:55,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:55,778 INFO L93 Difference]: Finished difference Result 22394 states and 22978 transitions. [2025-01-09 00:06:55,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:06:55,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 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 1744 [2025-01-09 00:06:55,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:55,791 INFO L225 Difference]: With dead ends: 22394 [2025-01-09 00:06:55,791 INFO L226 Difference]: Without dead ends: 13493 [2025-01-09 00:06:55,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:06:55,798 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 141 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:55,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 38 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:06:55,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2025-01-09 00:06:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 11519. [2025-01-09 00:06:55,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11519 states, 11518 states have (on average 1.0264802917173121) internal successors, (11823), 11518 states have internal predecessors, (11823), 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:06:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11519 states to 11519 states and 11823 transitions. [2025-01-09 00:06:55,980 INFO L78 Accepts]: Start accepts. Automaton has 11519 states and 11823 transitions. Word has length 1744 [2025-01-09 00:06:55,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:55,981 INFO L471 AbstractCegarLoop]: Abstraction has 11519 states and 11823 transitions. [2025-01-09 00:06:55,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 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:06:55,981 INFO L276 IsEmpty]: Start isEmpty. Operand 11519 states and 11823 transitions. [2025-01-09 00:06:56,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1867 [2025-01-09 00:06:56,002 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:56,003 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 9, 9, 9, 9, 9, 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, 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, 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, 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] [2025-01-09 00:06:56,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:06:56,003 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:56,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:56,004 INFO L85 PathProgramCache]: Analyzing trace with hash 816168520, now seen corresponding path program 1 times [2025-01-09 00:06:56,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:56,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480480454] [2025-01-09 00:06:56,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:56,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:56,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1866 statements into 1 equivalence classes. [2025-01-09 00:06:56,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1866 of 1866 statements. [2025-01-09 00:06:56,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:56,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:57,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6939 backedges. 2916 proven. 0 refuted. 0 times theorem prover too weak. 4023 trivial. 0 not checked. [2025-01-09 00:06:57,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:57,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480480454] [2025-01-09 00:06:57,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480480454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:57,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:57,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:57,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978662201] [2025-01-09 00:06:57,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:57,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:57,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:57,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:57,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:57,321 INFO L87 Difference]: Start difference. First operand 11519 states and 11823 transitions. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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:06:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:58,018 INFO L93 Difference]: Finished difference Result 24021 states and 24645 transitions. [2025-01-09 00:06:58,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:58,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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 1866 [2025-01-09 00:06:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:58,020 INFO L225 Difference]: With dead ends: 24021 [2025-01-09 00:06:58,020 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:06:58,033 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:06:58,036 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 112 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:58,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 409 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:06:58,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:06:58,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:06:58,037 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:06:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:06:58,037 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1866 [2025-01-09 00:06:58,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:58,038 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:06:58,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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:06:58,042 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:06:58,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:06:58,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:06:58,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:06:58,054 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:58,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 00:06:58,995 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:06:59,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:06:59 BoogieIcfgContainer [2025-01-09 00:06:59,031 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:06:59,032 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:06:59,032 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:06:59,032 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:06:59,035 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:06:24" (3/4) ... [2025-01-09 00:06:59,039 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 00:06:59,093 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 00:06:59,095 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 00:06:59,100 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 00:06:59,105 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 00:06:59,375 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 00:06:59,378 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 00:06:59,378 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:06:59,382 INFO L158 Benchmark]: Toolchain (without parser) took 37387.08ms. Allocated memory was 142.6MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 108.3MB in the beginning and 1.0GB in the end (delta: -897.3MB). Peak memory consumption was 783.5MB. Max. memory is 16.1GB. [2025-01-09 00:06:59,382 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:06:59,382 INFO L158 Benchmark]: CACSL2BoogieTranslator took 595.85ms. Allocated memory is still 142.6MB. Free memory was 108.3MB in the beginning and 50.3MB in the end (delta: 58.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-09 00:06:59,382 INFO L158 Benchmark]: Boogie Procedure Inliner took 169.92ms. Allocated memory is still 142.6MB. Free memory was 50.3MB in the beginning and 90.7MB in the end (delta: -40.4MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2025-01-09 00:06:59,382 INFO L158 Benchmark]: Boogie Preprocessor took 167.47ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 56.4MB in the end (delta: 34.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 00:06:59,383 INFO L158 Benchmark]: RCFGBuilder took 1737.07ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 56.4MB in the beginning and 48.3MB in the end (delta: 8.1MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2025-01-09 00:06:59,383 INFO L158 Benchmark]: TraceAbstraction took 34364.68ms. Allocated memory was 184.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 47.4MB in the beginning and 1.0GB in the end (delta: -983.1MB). Peak memory consumption was 651.8MB. Max. memory is 16.1GB. [2025-01-09 00:06:59,383 INFO L158 Benchmark]: Witness Printer took 346.30ms. Allocated memory is still 1.8GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 00:06:59,384 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.14ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 595.85ms. Allocated memory is still 142.6MB. Free memory was 108.3MB in the beginning and 50.3MB in the end (delta: 58.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 169.92ms. Allocated memory is still 142.6MB. Free memory was 50.3MB in the beginning and 90.7MB in the end (delta: -40.4MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 167.47ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 56.4MB in the end (delta: 34.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1737.07ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 56.4MB in the beginning and 48.3MB in the end (delta: 8.1MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. * TraceAbstraction took 34364.68ms. Allocated memory was 184.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 47.4MB in the beginning and 1.0GB in the end (delta: -983.1MB). Peak memory consumption was 651.8MB. Max. memory is 16.1GB. * Witness Printer took 346.30ms. Allocated memory is still 1.8GB. Free memory was 1.0GB in the beginning and 1.0GB 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: 185]: 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: 33.3s, OverallIterations: 18, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4804 SdHoareTripleChecker+Valid, 16.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4804 mSDsluCounter, 5230 SdHoareTripleChecker+Invalid, 13.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 252 mSDsCounter, 2579 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16333 IncrementalHoareTripleChecker+Invalid, 18912 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2579 mSolverCounterUnsat, 4978 mSDtfsCounter, 16333 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1460 GetRequests, 1427 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11519occurred in iteration=17, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 4278 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 15950 NumberOfCodeBlocks, 15950 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 15930 ConstructedInterpolants, 0 QuantifiedInterpolants, 31917 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1654 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 20 InterpolantComputations, 18 PerfectInterpolantSequences, 35121/35792 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) && (a12 == 8)) && (4 <= a15)) || (((a16 == 9) && (a12 == 8)) && (0 <= ((long long) 154 + a18)))) || (((a16 == 10) && (a12 == 8)) && (a15 == 3))) || ((a12 == 9) && (a16 == 9))) || (((a16 == 8) && (a15 == 4)) && (7 == a12))) || ((((a16 == 8) && (a12 == 8)) && (a15 == 3)) && (567606 <= a18))) || ((a12 == 6) && (a16 <= 11))) || (((a15 <= 3) && (a12 == 8)) && (((long long) a18 + 156) <= 0))) || (((a16 <= 8) && (a12 == 8)) && (((long long) a18 + 156) <= 0))) || (((a15 <= 3) && (0 <= ((long long) 154 + a18))) && (a12 <= 7))) || ((a12 == 9) && (a15 <= 3))) || ((((a16 <= 8) && (a12 == 8)) && (0 <= ((long long) 154 + a18))) && (4 <= a15))) || (((a15 <= 3) && (a12 <= 7)) && (a16 <= 11))) || ((((a15 <= 3) && (a12 == 8)) && (0 <= ((long long) 154 + a18))) && (11 <= a16))) || ((a12 <= 5) && (a16 <= 11))) || ((a16 == 9) && (a12 <= 7))) || (((a16 <= 8) && (a12 == 9)) && (0 <= ((long long) 154 + a18)))) RESULT: Ultimate proved your program to be correct! [2025-01-09 00:06:59,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE