./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label54.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/Problem15_label54.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 4c52ec07a463523a7400028d070720f187a378d4cbca4c6c694254a0e1ef7e72 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:04:37,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:04:37,974 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:04:37,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:04:37,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:04:38,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:04:38,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:04:38,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:04:38,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:04:38,010 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:04:38,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:04:38,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:04:38,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:04:38,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:04:38,011 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:04:38,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:04:38,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:04:38,012 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:04:38,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:04:38,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:04:38,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:04:38,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:04:38,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:04:38,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:04:38,013 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:04:38,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:04:38,013 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:04:38,013 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:04:38,013 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:04:38,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:04:38,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:04:38,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:04:38,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:04:38,013 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:04:38,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:04:38,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:04:38,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:04:38,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:04:38,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:04:38,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:04:38,014 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:04:38,015 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:04:38,015 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:04:38,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:04:38,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:04:38,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:04:38,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:04:38,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:04:38,015 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 -> 4c52ec07a463523a7400028d070720f187a378d4cbca4c6c694254a0e1ef7e72 [2025-01-09 00:04:38,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:04:38,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:04:38,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:04:38,320 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:04:38,322 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:04:38,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label54.c [2025-01-09 00:04:39,578 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8e6d3592/9071ee36efca46228c853be38f8efe6a/FLAG66071f502 [2025-01-09 00:04:39,878 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:04:39,878 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label54.c [2025-01-09 00:04:39,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8e6d3592/9071ee36efca46228c853be38f8efe6a/FLAG66071f502 [2025-01-09 00:04:39,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8e6d3592/9071ee36efca46228c853be38f8efe6a [2025-01-09 00:04:39,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:04:39,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:04:39,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:04:39,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:04:39,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:04:39,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:04:39" (1/1) ... [2025-01-09 00:04:39,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cdfd7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:39, skipping insertion in model container [2025-01-09 00:04:39,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:04:39" (1/1) ... [2025-01-09 00:04:39,947 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:04:40,057 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/Problem15_label54.c[4982,4995] [2025-01-09 00:04:40,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:04:40,311 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:04:40,335 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/Problem15_label54.c[4982,4995] [2025-01-09 00:04:40,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:04:40,490 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:04:40,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:40 WrapperNode [2025-01-09 00:04:40,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:04:40,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:04:40,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:04:40,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:04:40,500 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:04:40" (1/1) ... [2025-01-09 00:04:40,523 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:04:40" (1/1) ... [2025-01-09 00:04:40,659 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-01-09 00:04:40,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:04:40,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:04:40,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:04:40,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:04:40,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:40" (1/1) ... [2025-01-09 00:04:40,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:40" (1/1) ... [2025-01-09 00:04:40,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:40" (1/1) ... [2025-01-09 00:04:40,814 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:04:40,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:40" (1/1) ... [2025-01-09 00:04:40,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:40" (1/1) ... [2025-01-09 00:04:40,872 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:40" (1/1) ... [2025-01-09 00:04:40,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:40" (1/1) ... [2025-01-09 00:04:40,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:40" (1/1) ... [2025-01-09 00:04:40,924 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:40" (1/1) ... [2025-01-09 00:04:40,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:40" (1/1) ... [2025-01-09 00:04:40,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:04:40,966 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:04:40,966 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:04:40,966 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:04:40,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:40" (1/1) ... [2025-01-09 00:04:40,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:04:41,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:04:41,014 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:04:41,025 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:04:41,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:04:41,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:04:41,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:04:41,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:04:41,089 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:04:41,090 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:04:42,955 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-01-09 00:04:42,955 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:04:42,975 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:04:42,975 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:04:42,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:04:42 BoogieIcfgContainer [2025-01-09 00:04:42,975 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:04:42,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:04:42,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:04:42,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:04:42,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:04:39" (1/3) ... [2025-01-09 00:04:42,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7104fe42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:04:42, skipping insertion in model container [2025-01-09 00:04:42,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:40" (2/3) ... [2025-01-09 00:04:42,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7104fe42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:04:42, skipping insertion in model container [2025-01-09 00:04:42,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:04:42" (3/3) ... [2025-01-09 00:04:42,985 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label54.c [2025-01-09 00:04:42,994 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:04:42,995 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label54.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:04:43,041 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:04:43,050 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;@db4099d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:04:43,050 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:04:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 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:04:43,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 00:04:43,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:04:43,060 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] [2025-01-09 00:04:43,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:04:43,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:04:43,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1322904494, now seen corresponding path program 1 times [2025-01-09 00:04:43,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:04:43,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212216585] [2025-01-09 00:04:43,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:43,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:04:43,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 00:04:43,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 00:04:43,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:43,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:43,309 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:04:43,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:43,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212216585] [2025-01-09 00:04:43,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212216585] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:43,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:04:43,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:04:43,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117159934] [2025-01-09 00:04:43,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:43,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:04:43,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:43,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:04:43,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:04:43,326 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 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 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 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:04:45,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:45,343 INFO L93 Difference]: Finished difference Result 1154 states and 2103 transitions. [2025-01-09 00:04:45,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:04:45,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2025-01-09 00:04:45,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:45,354 INFO L225 Difference]: With dead ends: 1154 [2025-01-09 00:04:45,355 INFO L226 Difference]: Without dead ends: 665 [2025-01-09 00:04:45,357 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:04:45,359 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 281 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:45,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 384 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:04:45,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-01-09 00:04:45,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2025-01-09 00:04:45,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 0 states have call successors, (0), 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:04:45,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions. [2025-01-09 00:04:45,403 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 40 [2025-01-09 00:04:45,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:45,404 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 981 transitions. [2025-01-09 00:04:45,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 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:04:45,404 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions. [2025-01-09 00:04:45,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 00:04:45,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:04:45,406 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:45,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:04:45,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:04:45,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:04:45,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1729322152, now seen corresponding path program 1 times [2025-01-09 00:04:45,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:04:45,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854037833] [2025-01-09 00:04:45,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:45,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:04:45,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 00:04:45,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 00:04:45,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:45,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:04:45,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:45,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854037833] [2025-01-09 00:04:45,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854037833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:45,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:04:45,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:04:45,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726071290] [2025-01-09 00:04:45,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:45,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:04:45,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:45,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:04:45,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:04:45,881 INFO L87 Difference]: Start difference. First operand 663 states and 981 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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:04:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:47,094 INFO L93 Difference]: Finished difference Result 1624 states and 2315 transitions. [2025-01-09 00:04:47,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:04:47,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-01-09 00:04:47,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:47,104 INFO L225 Difference]: With dead ends: 1624 [2025-01-09 00:04:47,105 INFO L226 Difference]: Without dead ends: 963 [2025-01-09 00:04:47,109 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:04:47,110 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:47,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 337 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:04:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-01-09 00:04:47,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2025-01-09 00:04:47,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 0 states have call successors, (0), 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:04:47,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions. [2025-01-09 00:04:47,195 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 105 [2025-01-09 00:04:47,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:47,195 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions. [2025-01-09 00:04:47,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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:04:47,196 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions. [2025-01-09 00:04:47,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 00:04:47,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:04:47,206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:47,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:04:47,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:04:47,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:04:47,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1372881756, now seen corresponding path program 1 times [2025-01-09 00:04:47,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:04:47,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352503554] [2025-01-09 00:04:47,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:47,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:04:47,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 00:04:47,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 00:04:47,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:47,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:47,468 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:04:47,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:47,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352503554] [2025-01-09 00:04:47,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352503554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:47,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:04:47,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:04:47,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270360690] [2025-01-09 00:04:47,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:47,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:04:47,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:47,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:04:47,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:04:47,470 INFO L87 Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:04:48,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:48,918 INFO L93 Difference]: Finished difference Result 2229 states and 3186 transitions. [2025-01-09 00:04:48,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:04:48,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-01-09 00:04:48,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:48,924 INFO L225 Difference]: With dead ends: 2229 [2025-01-09 00:04:48,924 INFO L226 Difference]: Without dead ends: 1567 [2025-01-09 00:04:48,925 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:04:48,926 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 256 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:48,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 318 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:04:48,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2025-01-09 00:04:48,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1266. [2025-01-09 00:04:48,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3043478260869565) internal successors, (1650), 1265 states have internal predecessors, (1650), 0 states have call successors, (0), 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:04:48,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1650 transitions. [2025-01-09 00:04:48,949 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1650 transitions. Word has length 110 [2025-01-09 00:04:48,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:48,949 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1650 transitions. [2025-01-09 00:04:48,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:04:48,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1650 transitions. [2025-01-09 00:04:48,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 00:04:48,956 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:04:48,956 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:04:48,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:04:48,956 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:04:48,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:04:48,957 INFO L85 PathProgramCache]: Analyzing trace with hash -630712671, now seen corresponding path program 1 times [2025-01-09 00:04:48,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:04:48,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030185254] [2025-01-09 00:04:48,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:48,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:04:49,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 00:04:49,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 00:04:49,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:49,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:04:49,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:49,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030185254] [2025-01-09 00:04:49,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030185254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:49,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:04:49,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:04:49,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111337763] [2025-01-09 00:04:49,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:49,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:04:49,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:49,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:04:49,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:04:49,297 INFO L87 Difference]: Start difference. First operand 1266 states and 1650 transitions. Second operand has 4 states, 4 states have (on average 51.5) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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:04:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:52,348 INFO L93 Difference]: Finished difference Result 4668 states and 6169 transitions. [2025-01-09 00:04:52,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:04:52,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-01-09 00:04:52,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:52,360 INFO L225 Difference]: With dead ends: 4668 [2025-01-09 00:04:52,360 INFO L226 Difference]: Without dead ends: 3404 [2025-01-09 00:04:52,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:04:52,363 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 484 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:52,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 373 Invalid, 2546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 00:04:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2025-01-09 00:04:52,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3381. [2025-01-09 00:04:52,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.2363905325443787) internal successors, (4179), 3380 states have internal predecessors, (4179), 0 states have call successors, (0), 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:04:52,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4179 transitions. [2025-01-09 00:04:52,415 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4179 transitions. Word has length 206 [2025-01-09 00:04:52,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:52,416 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4179 transitions. [2025-01-09 00:04:52,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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:04:52,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4179 transitions. [2025-01-09 00:04:52,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 00:04:52,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:04:52,420 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:04:52,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:04:52,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:04:52,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:04:52,420 INFO L85 PathProgramCache]: Analyzing trace with hash -796645353, now seen corresponding path program 1 times [2025-01-09 00:04:52,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:04:52,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079990161] [2025-01-09 00:04:52,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:52,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:04:52,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 00:04:52,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 00:04:52,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:52,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:52,713 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-09 00:04:52,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:52,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079990161] [2025-01-09 00:04:52,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079990161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:52,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:04:52,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:04:52,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744018133] [2025-01-09 00:04:52,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:52,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:04:52,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:52,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:04:52,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:04:52,714 INFO L87 Difference]: Start difference. First operand 3381 states and 4179 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 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:04:53,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:53,994 INFO L93 Difference]: Finished difference Result 8563 states and 10751 transitions. [2025-01-09 00:04:53,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:04:53,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 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 210 [2025-01-09 00:04:53,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:54,017 INFO L225 Difference]: With dead ends: 8563 [2025-01-09 00:04:54,018 INFO L226 Difference]: Without dead ends: 5483 [2025-01-09 00:04:54,020 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:04:54,021 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:54,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 339 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:04:54,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2025-01-09 00:04:54,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2025-01-09 00:04:54,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1683403322987036) internal successors, (6399), 5477 states have internal predecessors, (6399), 0 states have call successors, (0), 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:04:54,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6399 transitions. [2025-01-09 00:04:54,087 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6399 transitions. Word has length 210 [2025-01-09 00:04:54,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:54,087 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6399 transitions. [2025-01-09 00:04:54,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 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:04:54,087 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6399 transitions. [2025-01-09 00:04:54,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-01-09 00:04:54,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:04:54,090 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:04:54,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:04:54,090 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:04:54,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:04:54,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1938064963, now seen corresponding path program 1 times [2025-01-09 00:04:54,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:04:54,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778947032] [2025-01-09 00:04:54,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:54,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:04:54,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 00:04:54,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 00:04:54,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:54,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 00:04:54,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:54,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778947032] [2025-01-09 00:04:54,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778947032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:54,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:04:54,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:04:54,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195097476] [2025-01-09 00:04:54,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:54,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:04:54,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:54,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:04:54,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:04:54,656 INFO L87 Difference]: Start difference. First operand 5478 states and 6399 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 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:04:55,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:55,976 INFO L93 Difference]: Finished difference Result 10655 states and 12485 transitions. [2025-01-09 00:04:55,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:04:55,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 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 312 [2025-01-09 00:04:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:55,989 INFO L225 Difference]: With dead ends: 10655 [2025-01-09 00:04:55,990 INFO L226 Difference]: Without dead ends: 5478 [2025-01-09 00:04:55,993 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:04:55,995 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:55,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:04:56,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2025-01-09 00:04:56,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2025-01-09 00:04:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1672448420668249) internal successors, (6393), 5477 states have internal predecessors, (6393), 0 states have call successors, (0), 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:04:56,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6393 transitions. [2025-01-09 00:04:56,061 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6393 transitions. Word has length 312 [2025-01-09 00:04:56,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:56,062 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6393 transitions. [2025-01-09 00:04:56,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 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:04:56,062 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6393 transitions. [2025-01-09 00:04:56,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-01-09 00:04:56,066 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:04:56,066 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:04:56,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:04:56,066 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:04:56,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:04:56,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1638644823, now seen corresponding path program 1 times [2025-01-09 00:04:56,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:04:56,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051812959] [2025-01-09 00:04:56,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:56,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:04:56,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-09 00:04:56,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-09 00:04:56,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:56,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 00:04:56,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:56,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051812959] [2025-01-09 00:04:56,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051812959] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:56,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:04:56,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:04:56,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741531709] [2025-01-09 00:04:56,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:56,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:04:56,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:56,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:04:56,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:04:56,262 INFO L87 Difference]: Start difference. First operand 5478 states and 6393 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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:04:57,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:57,477 INFO L93 Difference]: Finished difference Result 11851 states and 14145 transitions. [2025-01-09 00:04:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:04:57,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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 327 [2025-01-09 00:04:57,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:57,490 INFO L225 Difference]: With dead ends: 11851 [2025-01-09 00:04:57,490 INFO L226 Difference]: Without dead ends: 6674 [2025-01-09 00:04:57,493 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:04:57,494 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 275 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:57,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 323 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:04:57,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2025-01-09 00:04:57,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 4577. [2025-01-09 00:04:57,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4577 states, 4576 states have (on average 1.1840034965034965) internal successors, (5418), 4576 states have internal predecessors, (5418), 0 states have call successors, (0), 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:04:57,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 5418 transitions. [2025-01-09 00:04:57,550 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 5418 transitions. Word has length 327 [2025-01-09 00:04:57,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:57,551 INFO L471 AbstractCegarLoop]: Abstraction has 4577 states and 5418 transitions. [2025-01-09 00:04:57,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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:04:57,551 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 5418 transitions. [2025-01-09 00:04:57,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-01-09 00:04:57,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:04:57,555 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:04:57,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:04:57,556 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:04:57,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:04:57,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1728756207, now seen corresponding path program 1 times [2025-01-09 00:04:57,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:04:57,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531937395] [2025-01-09 00:04:57,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:57,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:04:57,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-01-09 00:04:57,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-01-09 00:04:57,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:57,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 75 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:04:58,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:58,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531937395] [2025-01-09 00:04:58,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531937395] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:04:58,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650385309] [2025-01-09 00:04:58,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:58,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:04:58,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:04:58,504 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:04:58,506 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:04:58,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-01-09 00:04:58,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-01-09 00:04:58,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:58,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:58,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:04:58,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:04:58,750 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:04:58,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:04:58,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650385309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:58,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:04:58,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-09 00:04:58,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820411259] [2025-01-09 00:04:58,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:58,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:04:58,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:58,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:04:58,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:04:58,752 INFO L87 Difference]: Start difference. First operand 4577 states and 5418 transitions. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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:04:59,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:59,956 INFO L93 Difference]: Finished difference Result 10958 states and 13239 transitions. [2025-01-09 00:04:59,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:04:59,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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 386 [2025-01-09 00:04:59,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:59,971 INFO L225 Difference]: With dead ends: 10958 [2025-01-09 00:04:59,971 INFO L226 Difference]: Without dead ends: 6682 [2025-01-09 00:04:59,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:04:59,975 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 249 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:59,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 344 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:04:59,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6682 states. [2025-01-09 00:05:00,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6682 to 6380. [2025-01-09 00:05:00,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6380 states, 6379 states have (on average 1.166483774886346) internal successors, (7441), 6379 states have internal predecessors, (7441), 0 states have call successors, (0), 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:05:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6380 states to 6380 states and 7441 transitions. [2025-01-09 00:05:00,041 INFO L78 Accepts]: Start accepts. Automaton has 6380 states and 7441 transitions. Word has length 386 [2025-01-09 00:05:00,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:00,041 INFO L471 AbstractCegarLoop]: Abstraction has 6380 states and 7441 transitions. [2025-01-09 00:05:00,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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:05:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 6380 states and 7441 transitions. [2025-01-09 00:05:00,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-01-09 00:05:00,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:00,047 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-09 00:05:00,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:05:00,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:05:00,248 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:00,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:00,249 INFO L85 PathProgramCache]: Analyzing trace with hash 579014020, now seen corresponding path program 1 times [2025-01-09 00:05:00,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:00,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660925592] [2025-01-09 00:05:00,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:00,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:00,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-01-09 00:05:00,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-01-09 00:05:00,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:00,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 277 proven. 39 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 00:05:00,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:00,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660925592] [2025-01-09 00:05:00,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660925592] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:05:00,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990962812] [2025-01-09 00:05:00,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:00,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:05:00,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:05:00,694 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:05:00,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:05:00,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-01-09 00:05:00,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-01-09 00:05:00,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:00,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:00,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 00:05:00,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:05:01,346 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 277 proven. 39 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 00:05:01,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:05:01,911 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 277 proven. 39 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 00:05:01,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990962812] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:05:01,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:05:01,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-09 00:05:01,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648402890] [2025-01-09 00:05:01,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:05:01,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 00:05:01,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:01,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 00:05:01,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:05:01,914 INFO L87 Difference]: Start difference. First operand 6380 states and 7441 transitions. Second operand has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 8 states have internal predecessors, (654), 0 states have call successors, (0), 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:05:07,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:07,305 INFO L93 Difference]: Finished difference Result 18999 states and 21936 transitions. [2025-01-09 00:05:07,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 00:05:07,306 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 8 states have internal predecessors, (654), 0 states have call successors, (0), 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 403 [2025-01-09 00:05:07,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:07,331 INFO L225 Difference]: With dead ends: 18999 [2025-01-09 00:05:07,332 INFO L226 Difference]: Without dead ends: 7278 [2025-01-09 00:05:07,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 815 GetRequests, 801 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-01-09 00:05:07,340 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 2890 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 6679 mSolverCounterSat, 675 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2890 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 7354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 675 IncrementalHoareTripleChecker+Valid, 6679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:07,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2890 Valid, 321 Invalid, 7354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [675 Valid, 6679 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-01-09 00:05:07,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7278 states. [2025-01-09 00:05:07,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7278 to 6677. [2025-01-09 00:05:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6677 states, 6676 states have (on average 1.1065008987417615) internal successors, (7387), 6676 states have internal predecessors, (7387), 0 states have call successors, (0), 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:05:07,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6677 states to 6677 states and 7387 transitions. [2025-01-09 00:05:07,468 INFO L78 Accepts]: Start accepts. Automaton has 6677 states and 7387 transitions. Word has length 403 [2025-01-09 00:05:07,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:07,469 INFO L471 AbstractCegarLoop]: Abstraction has 6677 states and 7387 transitions. [2025-01-09 00:05:07,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 8 states have internal predecessors, (654), 0 states have call successors, (0), 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:05:07,469 INFO L276 IsEmpty]: Start isEmpty. Operand 6677 states and 7387 transitions. [2025-01-09 00:05:07,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-01-09 00:05:07,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:07,483 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:05:07,492 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:05:07,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:05:07,684 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:07,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:07,684 INFO L85 PathProgramCache]: Analyzing trace with hash -901893976, now seen corresponding path program 1 times [2025-01-09 00:05:07,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:07,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848430132] [2025-01-09 00:05:07,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:07,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:07,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-01-09 00:05:07,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-01-09 00:05:07,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:07,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:07,975 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 00:05:07,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:07,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848430132] [2025-01-09 00:05:07,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848430132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:07,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:07,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:07,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422640883] [2025-01-09 00:05:07,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:07,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:07,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:07,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:07,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:07,978 INFO L87 Difference]: Start difference. First operand 6677 states and 7387 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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:05:09,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:09,169 INFO L93 Difference]: Finished difference Result 15147 states and 16840 transitions. [2025-01-09 00:05:09,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:09,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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 417 [2025-01-09 00:05:09,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:09,187 INFO L225 Difference]: With dead ends: 15147 [2025-01-09 00:05:09,187 INFO L226 Difference]: Without dead ends: 8472 [2025-01-09 00:05:09,192 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:05:09,193 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 285 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:09,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 548 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:05:09,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8472 states. [2025-01-09 00:05:09,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8472 to 8171. [2025-01-09 00:05:09,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8171 states, 8170 states have (on average 1.086046511627907) internal successors, (8873), 8170 states have internal predecessors, (8873), 0 states have call successors, (0), 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:05:09,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8171 states to 8171 states and 8873 transitions. [2025-01-09 00:05:09,284 INFO L78 Accepts]: Start accepts. Automaton has 8171 states and 8873 transitions. Word has length 417 [2025-01-09 00:05:09,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:09,284 INFO L471 AbstractCegarLoop]: Abstraction has 8171 states and 8873 transitions. [2025-01-09 00:05:09,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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:05:09,285 INFO L276 IsEmpty]: Start isEmpty. Operand 8171 states and 8873 transitions. [2025-01-09 00:05:09,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-01-09 00:05:09,288 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:09,289 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:05:09,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:05:09,289 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:09,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:09,290 INFO L85 PathProgramCache]: Analyzing trace with hash -523001168, now seen corresponding path program 1 times [2025-01-09 00:05:09,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:09,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073114380] [2025-01-09 00:05:09,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:09,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:09,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-01-09 00:05:09,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-01-09 00:05:09,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:09,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-01-09 00:05:09,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:09,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073114380] [2025-01-09 00:05:09,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073114380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:09,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:09,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:09,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51749570] [2025-01-09 00:05:09,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:09,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:09,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:09,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:09,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:09,557 INFO L87 Difference]: Start difference. First operand 8171 states and 8873 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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:05:10,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:10,461 INFO L93 Difference]: Finished difference Result 16338 states and 17786 transitions. [2025-01-09 00:05:10,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:10,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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 541 [2025-01-09 00:05:10,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:10,472 INFO L225 Difference]: With dead ends: 16338 [2025-01-09 00:05:10,472 INFO L226 Difference]: Without dead ends: 8468 [2025-01-09 00:05:10,475 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:05:10,477 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 438 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:10,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 70 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:05:10,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8468 states. [2025-01-09 00:05:10,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8468 to 8169. [2025-01-09 00:05:10,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8169 states, 8168 states have (on average 1.085822722820764) internal successors, (8869), 8168 states have internal predecessors, (8869), 0 states have call successors, (0), 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:05:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8169 states to 8169 states and 8869 transitions. [2025-01-09 00:05:10,532 INFO L78 Accepts]: Start accepts. Automaton has 8169 states and 8869 transitions. Word has length 541 [2025-01-09 00:05:10,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:10,533 INFO L471 AbstractCegarLoop]: Abstraction has 8169 states and 8869 transitions. [2025-01-09 00:05:10,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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:05:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 8169 states and 8869 transitions. [2025-01-09 00:05:10,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-01-09 00:05:10,536 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:10,536 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:05:10,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:05:10,536 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:10,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:10,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1424924345, now seen corresponding path program 1 times [2025-01-09 00:05:10,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:10,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497320555] [2025-01-09 00:05:10,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:10,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:10,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-01-09 00:05:10,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-01-09 00:05:10,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:10,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-01-09 00:05:10,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:10,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497320555] [2025-01-09 00:05:10,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497320555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:10,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:10,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:10,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540292930] [2025-01-09 00:05:10,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:10,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:10,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:10,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:10,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:10,882 INFO L87 Difference]: Start difference. First operand 8169 states and 8869 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:12,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:12,193 INFO L93 Difference]: Finished difference Result 19054 states and 20734 transitions. [2025-01-09 00:05:12,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:12,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 567 [2025-01-09 00:05:12,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:12,207 INFO L225 Difference]: With dead ends: 19054 [2025-01-09 00:05:12,208 INFO L226 Difference]: Without dead ends: 10887 [2025-01-09 00:05:12,214 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:05:12,216 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 297 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:12,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 248 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:05:12,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2025-01-09 00:05:12,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 8471. [2025-01-09 00:05:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8471 states, 8470 states have (on average 1.084297520661157) internal successors, (9184), 8470 states have internal predecessors, (9184), 0 states have call successors, (0), 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:05:12,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8471 states to 8471 states and 9184 transitions. [2025-01-09 00:05:12,286 INFO L78 Accepts]: Start accepts. Automaton has 8471 states and 9184 transitions. Word has length 567 [2025-01-09 00:05:12,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:12,288 INFO L471 AbstractCegarLoop]: Abstraction has 8471 states and 9184 transitions. [2025-01-09 00:05:12,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:12,288 INFO L276 IsEmpty]: Start isEmpty. Operand 8471 states and 9184 transitions. [2025-01-09 00:05:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-01-09 00:05:12,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:12,291 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:05:12,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:05:12,291 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:12,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:12,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1394392390, now seen corresponding path program 1 times [2025-01-09 00:05:12,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:12,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572944757] [2025-01-09 00:05:12,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:12,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:12,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-01-09 00:05:12,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-01-09 00:05:12,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:12,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:12,646 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-01-09 00:05:12,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:12,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572944757] [2025-01-09 00:05:12,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572944757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:12,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:12,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:12,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254009659] [2025-01-09 00:05:12,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:12,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:12,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:12,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:12,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:12,648 INFO L87 Difference]: Start difference. First operand 8471 states and 9184 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:13,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:13,552 INFO L93 Difference]: Finished difference Result 19630 states and 21365 transitions. [2025-01-09 00:05:13,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:13,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 575 [2025-01-09 00:05:13,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:13,564 INFO L225 Difference]: With dead ends: 19630 [2025-01-09 00:05:13,564 INFO L226 Difference]: Without dead ends: 11161 [2025-01-09 00:05:13,573 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:05:13,574 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 276 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:13,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 538 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:05:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11161 states. [2025-01-09 00:05:13,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11161 to 10563. [2025-01-09 00:05:13,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10563 states, 10562 states have (on average 1.0707252414315471) internal successors, (11309), 10562 states have internal predecessors, (11309), 0 states have call successors, (0), 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:05:13,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10563 states to 10563 states and 11309 transitions. [2025-01-09 00:05:13,665 INFO L78 Accepts]: Start accepts. Automaton has 10563 states and 11309 transitions. Word has length 575 [2025-01-09 00:05:13,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:13,666 INFO L471 AbstractCegarLoop]: Abstraction has 10563 states and 11309 transitions. [2025-01-09 00:05:13,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:13,666 INFO L276 IsEmpty]: Start isEmpty. Operand 10563 states and 11309 transitions. [2025-01-09 00:05:13,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2025-01-09 00:05:13,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:13,670 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:05:13,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:05:13,671 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:13,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:13,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1908322376, now seen corresponding path program 1 times [2025-01-09 00:05:13,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:13,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416900968] [2025-01-09 00:05:13,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:13,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:13,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-01-09 00:05:13,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-01-09 00:05:13,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:13,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-01-09 00:05:13,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:13,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416900968] [2025-01-09 00:05:13,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416900968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:13,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:13,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:13,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689733666] [2025-01-09 00:05:13,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:13,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:13,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:13,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:13,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:13,844 INFO L87 Difference]: Start difference. First operand 10563 states and 11309 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:14,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:14,667 INFO L93 Difference]: Finished difference Result 23814 states and 25604 transitions. [2025-01-09 00:05:14,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:14,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 578 [2025-01-09 00:05:14,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:14,681 INFO L225 Difference]: With dead ends: 23814 [2025-01-09 00:05:14,682 INFO L226 Difference]: Without dead ends: 13253 [2025-01-09 00:05:14,690 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:05:14,690 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 305 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:14,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 465 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:05:14,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13253 states. [2025-01-09 00:05:14,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13253 to 13253. [2025-01-09 00:05:14,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13253 states, 13252 states have (on average 1.0642167220042258) internal successors, (14103), 13252 states have internal predecessors, (14103), 0 states have call successors, (0), 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:05:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13253 states to 13253 states and 14103 transitions. [2025-01-09 00:05:14,800 INFO L78 Accepts]: Start accepts. Automaton has 13253 states and 14103 transitions. Word has length 578 [2025-01-09 00:05:14,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:14,801 INFO L471 AbstractCegarLoop]: Abstraction has 13253 states and 14103 transitions. [2025-01-09 00:05:14,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:14,801 INFO L276 IsEmpty]: Start isEmpty. Operand 13253 states and 14103 transitions. [2025-01-09 00:05:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-01-09 00:05:14,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:14,809 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:14,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:05:14,809 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:14,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:14,810 INFO L85 PathProgramCache]: Analyzing trace with hash 77847253, now seen corresponding path program 1 times [2025-01-09 00:05:14,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:14,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949918447] [2025-01-09 00:05:14,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:14,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:14,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-01-09 00:05:14,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-01-09 00:05:14,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:14,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-01-09 00:05:15,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:15,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949918447] [2025-01-09 00:05:15,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949918447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:15,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:15,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:15,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143872894] [2025-01-09 00:05:15,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:15,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:15,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:15,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:15,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:15,164 INFO L87 Difference]: Start difference. First operand 13253 states and 14103 transitions. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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:05:16,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:16,393 INFO L93 Difference]: Finished difference Result 28896 states and 30998 transitions. [2025-01-09 00:05:16,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:16,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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 730 [2025-01-09 00:05:16,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:16,408 INFO L225 Difference]: With dead ends: 28896 [2025-01-09 00:05:16,408 INFO L226 Difference]: Without dead ends: 15944 [2025-01-09 00:05:16,419 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:05:16,420 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 160 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:16,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 515 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:05:16,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15944 states. [2025-01-09 00:05:16,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15944 to 15645. [2025-01-09 00:05:16,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15645 states, 15644 states have (on average 1.0582331884428535) internal successors, (16555), 15644 states have internal predecessors, (16555), 0 states have call successors, (0), 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:05:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15645 states to 15645 states and 16555 transitions. [2025-01-09 00:05:16,541 INFO L78 Accepts]: Start accepts. Automaton has 15645 states and 16555 transitions. Word has length 730 [2025-01-09 00:05:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:16,542 INFO L471 AbstractCegarLoop]: Abstraction has 15645 states and 16555 transitions. [2025-01-09 00:05:16,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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:05:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 15645 states and 16555 transitions. [2025-01-09 00:05:16,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2025-01-09 00:05:16,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:16,552 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-09 00:05:16,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:05:16,552 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:16,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:16,555 INFO L85 PathProgramCache]: Analyzing trace with hash 336938394, now seen corresponding path program 1 times [2025-01-09 00:05:16,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:16,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618419316] [2025-01-09 00:05:16,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:16,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:16,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 817 statements into 1 equivalence classes. [2025-01-09 00:05:16,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 817 of 817 statements. [2025-01-09 00:05:16,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:16,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 844 proven. 345 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-01-09 00:05:17,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:17,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618419316] [2025-01-09 00:05:17,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618419316] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:05:17,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688191705] [2025-01-09 00:05:17,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:17,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:05:17,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:05:17,556 INFO L229 MonitoredProcess]: Starting monitored process 4 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:05:17,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 00:05:17,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 817 statements into 1 equivalence classes. [2025-01-09 00:05:17,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 817 of 817 statements. [2025-01-09 00:05:17,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:17,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:17,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:05:17,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:05:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 999 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-01-09 00:05:17,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:05:17,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688191705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:17,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:05:17,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 00:05:17,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324007679] [2025-01-09 00:05:17,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:17,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:17,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:17,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:17,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:05:17,922 INFO L87 Difference]: Start difference. First operand 15645 states and 16555 transitions. Second operand has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 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:05:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:18,655 INFO L93 Difference]: Finished difference Result 30691 states and 32505 transitions. [2025-01-09 00:05:18,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:18,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 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 817 [2025-01-09 00:05:18,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:18,667 INFO L225 Difference]: With dead ends: 30691 [2025-01-09 00:05:18,667 INFO L226 Difference]: Without dead ends: 15347 [2025-01-09 00:05:18,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 818 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:05:18,676 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 219 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:18,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 397 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:05:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15347 states. [2025-01-09 00:05:18,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15347 to 15343. [2025-01-09 00:05:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15343 states, 15342 states have (on average 1.0517533567983315) internal successors, (16136), 15342 states have internal predecessors, (16136), 0 states have call successors, (0), 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:05:18,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15343 states to 15343 states and 16136 transitions. [2025-01-09 00:05:18,795 INFO L78 Accepts]: Start accepts. Automaton has 15343 states and 16136 transitions. Word has length 817 [2025-01-09 00:05:18,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:18,795 INFO L471 AbstractCegarLoop]: Abstraction has 15343 states and 16136 transitions. [2025-01-09 00:05:18,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 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:05:18,796 INFO L276 IsEmpty]: Start isEmpty. Operand 15343 states and 16136 transitions. [2025-01-09 00:05:18,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 825 [2025-01-09 00:05:18,804 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:18,804 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:18,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 00:05:19,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:05:19,005 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:19,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:19,006 INFO L85 PathProgramCache]: Analyzing trace with hash 105157902, now seen corresponding path program 1 times [2025-01-09 00:05:19,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:19,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334223352] [2025-01-09 00:05:19,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:19,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:19,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 824 statements into 1 equivalence classes. [2025-01-09 00:05:19,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 824 of 824 statements. [2025-01-09 00:05:19,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:19,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2025-01-09 00:05:19,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:19,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334223352] [2025-01-09 00:05:19,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334223352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:19,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:19,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:19,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844882234] [2025-01-09 00:05:19,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:19,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:19,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:19,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:19,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:19,284 INFO L87 Difference]: Start difference. First operand 15343 states and 16136 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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:05:20,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:20,035 INFO L93 Difference]: Finished difference Result 34271 states and 36111 transitions. [2025-01-09 00:05:20,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:20,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 824 [2025-01-09 00:05:20,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:20,053 INFO L225 Difference]: With dead ends: 34271 [2025-01-09 00:05:20,053 INFO L226 Difference]: Without dead ends: 19229 [2025-01-09 00:05:20,064 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:05:20,064 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 369 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:20,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 415 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:05:20,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19229 states. [2025-01-09 00:05:20,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19229 to 15641. [2025-01-09 00:05:20,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15641 states, 15640 states have (on average 1.0546675191815857) internal successors, (16495), 15640 states have internal predecessors, (16495), 0 states have call successors, (0), 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:05:20,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15641 states to 15641 states and 16495 transitions. [2025-01-09 00:05:20,196 INFO L78 Accepts]: Start accepts. Automaton has 15641 states and 16495 transitions. Word has length 824 [2025-01-09 00:05:20,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:20,196 INFO L471 AbstractCegarLoop]: Abstraction has 15641 states and 16495 transitions. [2025-01-09 00:05:20,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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:05:20,197 INFO L276 IsEmpty]: Start isEmpty. Operand 15641 states and 16495 transitions. [2025-01-09 00:05:20,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2025-01-09 00:05:20,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:20,206 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:05:20,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:05:20,206 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:20,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:20,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1591406268, now seen corresponding path program 1 times [2025-01-09 00:05:20,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:20,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027302494] [2025-01-09 00:05:20,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:20,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:20,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 846 statements into 1 equivalence classes. [2025-01-09 00:05:20,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 846 of 846 statements. [2025-01-09 00:05:20,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:20,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:20,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2025-01-09 00:05:20,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:20,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027302494] [2025-01-09 00:05:20,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027302494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:20,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:20,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:20,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209760283] [2025-01-09 00:05:20,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:20,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:20,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:20,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:20,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:20,861 INFO L87 Difference]: Start difference. First operand 15641 states and 16495 transitions. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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:05:21,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:21,616 INFO L93 Difference]: Finished difference Result 30980 states and 32686 transitions. [2025-01-09 00:05:21,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:21,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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 846 [2025-01-09 00:05:21,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:21,632 INFO L225 Difference]: With dead ends: 30980 [2025-01-09 00:05:21,632 INFO L226 Difference]: Without dead ends: 15341 [2025-01-09 00:05:21,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:05:21,642 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 211 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:21,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 108 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:05:21,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15341 states. [2025-01-09 00:05:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15341 to 14742. [2025-01-09 00:05:21,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14742 states, 14741 states have (on average 1.0476222780001356) internal successors, (15443), 14741 states have internal predecessors, (15443), 0 states have call successors, (0), 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:05:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14742 states to 14742 states and 15443 transitions. [2025-01-09 00:05:21,756 INFO L78 Accepts]: Start accepts. Automaton has 14742 states and 15443 transitions. Word has length 846 [2025-01-09 00:05:21,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:21,756 INFO L471 AbstractCegarLoop]: Abstraction has 14742 states and 15443 transitions. [2025-01-09 00:05:21,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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:05:21,757 INFO L276 IsEmpty]: Start isEmpty. Operand 14742 states and 15443 transitions. [2025-01-09 00:05:21,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 920 [2025-01-09 00:05:21,768 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:21,769 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:21,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:05:21,769 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:21,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:21,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2108991734, now seen corresponding path program 1 times [2025-01-09 00:05:21,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:21,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703672917] [2025-01-09 00:05:21,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:21,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:21,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 919 statements into 1 equivalence classes. [2025-01-09 00:05:21,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 919 of 919 statements. [2025-01-09 00:05:21,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:21,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1399 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2025-01-09 00:05:22,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:22,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703672917] [2025-01-09 00:05:22,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703672917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:22,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:22,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:22,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730559384] [2025-01-09 00:05:22,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:22,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:22,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:22,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:22,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:22,325 INFO L87 Difference]: Start difference. First operand 14742 states and 15443 transitions. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 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:05:23,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:23,108 INFO L93 Difference]: Finished difference Result 26449 states and 27548 transitions. [2025-01-09 00:05:23,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:23,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 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 919 [2025-01-09 00:05:23,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:23,110 INFO L225 Difference]: With dead ends: 26449 [2025-01-09 00:05:23,110 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:05:23,120 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:05:23,121 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 249 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:23,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 70 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:05:23,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:05:23,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:05:23,122 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:05:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:05:23,122 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 919 [2025-01-09 00:05:23,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:23,123 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:05:23,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 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:05:23,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:05:23,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:05:23,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:05:23,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:05:23,132 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:23,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 00:05:24,031 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:05:24,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:05:24 BoogieIcfgContainer [2025-01-09 00:05:24,042 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:05:24,043 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:05:24,043 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:05:24,043 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:05:24,044 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:04:42" (3/4) ... [2025-01-09 00:05:24,045 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 00:05:24,068 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 00:05:24,070 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 00:05:24,071 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 00:05:24,072 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 00:05:24,210 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 00:05:24,210 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 00:05:24,211 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:05:24,212 INFO L158 Benchmark]: Toolchain (without parser) took 44304.36ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 108.5MB in the beginning and 641.5MB in the end (delta: -532.9MB). Peak memory consumption was 724.5MB. Max. memory is 16.1GB. [2025-01-09 00:05:24,212 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:05:24,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.54ms. Allocated memory is still 142.6MB. Free memory was 108.5MB in the beginning and 97.0MB in the end (delta: 11.5MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. [2025-01-09 00:05:24,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 166.55ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 60.1MB in the end (delta: 36.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 00:05:24,212 INFO L158 Benchmark]: Boogie Preprocessor took 303.68ms. Allocated memory is still 142.6MB. Free memory was 60.1MB in the beginning and 51.9MB in the end (delta: 8.2MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2025-01-09 00:05:24,213 INFO L158 Benchmark]: RCFGBuilder took 2009.35ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 51.9MB in the beginning and 93.7MB in the end (delta: -41.8MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. [2025-01-09 00:05:24,213 INFO L158 Benchmark]: TraceAbstraction took 41062.58ms. Allocated memory was 251.7MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 91.0MB in the beginning and 666.6MB in the end (delta: -575.6MB). Peak memory consumption was 579.0MB. Max. memory is 16.1GB. [2025-01-09 00:05:24,214 INFO L158 Benchmark]: Witness Printer took 168.16ms. Allocated memory is still 1.4GB. Free memory was 666.6MB in the beginning and 641.5MB in the end (delta: 25.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 00:05:24,215 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.18ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 584.54ms. Allocated memory is still 142.6MB. Free memory was 108.5MB in the beginning and 97.0MB in the end (delta: 11.5MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 166.55ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 60.1MB in the end (delta: 36.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 303.68ms. Allocated memory is still 142.6MB. Free memory was 60.1MB in the beginning and 51.9MB in the end (delta: 8.2MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. * RCFGBuilder took 2009.35ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 51.9MB in the beginning and 93.7MB in the end (delta: -41.8MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. * TraceAbstraction took 41062.58ms. Allocated memory was 251.7MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 91.0MB in the beginning and 666.6MB in the end (delta: -575.6MB). Peak memory consumption was 579.0MB. Max. memory is 16.1GB. * Witness Printer took 168.16ms. Allocated memory is still 1.4GB. Free memory was 666.6MB in the beginning and 641.5MB in the end (delta: 25.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 137]: 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, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.1s, OverallIterations: 19, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 28.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7843 SdHoareTripleChecker+Valid, 26.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7843 mSDsluCounter, 6472 SdHoareTripleChecker+Invalid, 22.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 839 mSDsCounter, 3417 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22670 IncrementalHoareTripleChecker+Invalid, 26087 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3417 mSolverCounterUnsat, 5633 mSDtfsCounter, 22670 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2072 GetRequests, 2033 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15645occurred in iteration=15, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 11435 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 10519 NumberOfCodeBlocks, 10519 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 10899 ConstructedInterpolants, 0 QuantifiedInterpolants, 34469 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1970 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 10793/11330 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: 1776]: Loop Invariant Derived loop invariant: (((((((((((((((2 == a2) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) || (((((long long) 42 + a4) <= 0) && (2 <= a2)) && (((long long) a0 + 147) <= 0))) || (((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (a2 == 1))) || ((a29 <= 41) && ((((((long long) 42 + a4) <= 0) && (a2 == 1)) && (((long long) a0 + 61) <= 0)) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (a2 == 1))))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (2 <= a2)) && (((long long) 98 + a0) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || (((2 <= a2) && (((long long) 89 + a4) <= 0)) && (a2 != 4))) || (((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (a2 == 4))) || ((((((long long) 89 + a4) <= 0) && (a2 == 1)) && (0 <= ((long long) 44 + a0))) && (((long long) a29 + 127) == 0))) || (((2 <= a2) && (((long long) 89 + a4) <= 0)) && (((long long) a29 + 18) <= 0))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (a2 == 1))) || (((((long long) 89 + a4) <= 0) && (0 <= ((long long) a0 + 60))) && (a2 == 4))) || (((((long long) 89 + a4) <= 0) && (((long long) a0 + 61) <= 0)) && (a2 <= 2))) RESULT: Ultimate proved your program to be correct! [2025-01-09 00:05:24,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE